Examples
Examples
Try the starting example
- Installation tasks [duration minutes,zero-based predecessors]; enter JSON
- [[10,[]],[20,[0]],[15,[0]]]
- Available interchangeable workers (count)
- 2
- Earliest start (minute)
- 0
- Required completion deadline (minute)
- 40
- Feasible precedence schedule (JSON)
- [{"task":1,"worker":1,"start":0,"end":10},{"task":2,"worker":1,"start":10,"end":30},{"task":3,"worker":2,"start":10,"end":25}]
- Completion time (minute)
- 30
- Deadline overrun (minutes)
- 0
Try another scenario
- Installation tasks [duration minutes,zero-based predecessors]; enter JSON
- [[15,[]],[20,[0]],[10,[1]]]
- Available interchangeable workers (count)
- 1
- Earliest start (minute)
- 10
- Required completion deadline (minute)
- 50
- Feasible precedence schedule (JSON)
- [{"task":1,"worker":1,"start":10,"end":25},{"task":2,"worker":1,"start":25,"end":45},{"task":3,"worker":1,"start":45,"end":55}]
- Completion time (minute)
- 55
- Deadline overrun (minutes)
- 5
Calculation method
Calculation method
Feasible precedence schedule (JSON)
Repeatedly choose earliest-start ready task and earliest-free worker; tie by task index then worker. Tasks are nonpreemptive.
Completion time (minute)
Maximum scheduled task end.
Deadline overrun (minutes)
max(0,completion−deadline).
Symbols and units
- a
- Installation tasks [duration minutes,zero-based predecessors]; enter JSON
- b
- Available interchangeable workers (count)
- c
- Earliest start (minute)
- d
- Required completion deadline (minute)
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Installation dependencies with interchangeable handlers and one global room-access window. Multiple room calendars and qualified handling teams are unsupported. Supported limits: All numeric inputs and computed intermediates must remain finite. Supported numeric input magnitude is zero or 1e-12 through 1e12 in absolute value; reject values outside this bounded range. All lists/JSON record tables are limited to 100 records unless a stricter bound is stated; reject malformed record arity and wrong member types. 1..100 tasks; positive durations; predecessor indices exist and graph is acyclic; workers 1..20. Interchangeable workers; no specialist equipment constraints unless encoded as dependencies.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.