Resource-constrained schedule
Schedule jobs with predecessor constraints and a shared resource capacity using a deterministic earliest-feasible list heuristic.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
Pick the earliest input-order job whose predecessors are scheduled, then place it in the earliest resource-feasible interval after predecessor completion.
With capacity 2, A(duration3,resources2), B(duration2,resources1) and C(duration1,resources1) after A run at 0–3, 3–5 and 3–4.
Up to 50 jobs, integer durations 1–10,000 and resource capacity 1–100. No preemption, calendar or multiple resource types; cycles are rejected. Input-order heuristic, not guaranteed optimal.
Frequently asked questions
Can reordering resource-constrained jobs change the result?
Yes. Ready jobs use input order as priority. Comparing orders still does not constitute global optimization.
Can a resource be reused exactly when a job ends?
Yes. Intervals include the start and exclude the end. Add cleanup time to durations if needed.
Calculation criteria and reference materials
- Google OR-Tools: Job Shop Problem
Precedence and resource conflict context; this tool uses a bounded heuristic, not an optimization solver.
Verification of calculation criteria: · Calculation·verification principles · Report errors