Examples
Examples
Try the starting example
- Tasks: name, duration, prerequisites joined by | or none, resource demands joined by |
- A,4,none,2|0 B,3,none,1|1 C,2,A,1|1
- Whole-number capacities for each resource
- 2,1
- Resource-constrained finish time
- 9
- Unlimited-resource critical-path finish
- 6
- Delay from resource constraints
- 3
- Task start–finish schedule
- A: 0–4; B: 4–7; C: 7–9
- Peak active demand by resource
- 2, 1
Try another scenario
- Tasks: name, duration, prerequisites joined by | or none, resource demands joined by |
- A,4,none,2|0 B,3,none,1|1 C,2,A,1|1
- Whole-number capacities for each resource
- 3,1
- Resource-constrained finish time
- 6
- Unlimited-resource critical-path finish
- 6
- Delay from resource constraints
- 0
- Task start–finish schedule
- A: 0–4; B: 0–3; C: 4–6
- Peak active demand by resource
- 3, 1
Calculation method
Calculation method
Resource-constrained finish time
At each completion event launch ready tasks in input order when all resource demands fit; tasks retain resources for their entire duration.
Unlimited-resource critical-path finish
Longest prerequisite path ignoring resource limits.
Delay from resource constraints
Constrained finish−unconstrained finish.
Task start–finish schedule
Show the uninterrupted start and end of every task.
Peak active demand by resource
Maximum simultaneous demand recorded during the schedule.
Symbols and units
- a
- Tasks: name, duration, prerequisites joined by | or none, resource demands joined by |
- b
- Whole-number capacities for each resource
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
- A feasible list-scheduling heuristic for up to 50 tasks and five resource types. It does not prove an optimal finish time. All durations, prerequisites and resource limits are supplied explicitly.
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.
Further reading
OpenStax: arithmetic and geometry ↗
Background reading; this does not imply endorsement or independent review of SumFizz.