Examples
Examples
Try the starting example
- JSON Tasks [ID,duration hours,eligible resource IDs,release hour,deadline hour,predecessor IDs]
- [["T1",2,["R1"],0,8,[]],["T2",3,["R1","R2"],0,8,[]],["T3",1,["R2"],0,8,["T1"]]]
- JSON Availability windows [resource ID,start hour,end hour]
- [["R1",0,4],["R2",4,8]]
- Scheduled tasks
- [["T1","R1",0,2],["T2","R2",4,7],["T3","R2",7,8]]
- Unassigned task IDs
- []
- Completion hour
- 8
- Assigned resource-hours
- 6
Try another scenario
- JSON Tasks [ID,duration hours,eligible resource IDs,release hour,deadline hour,predecessor IDs]
- [["T1",4,["R1"],0,8,[]],["T2",3,["R1","R2"],0,8,[]],["T3",1,["R2"],0,8,["T1"]]]
- JSON Availability windows [resource ID,start hour,end hour]
- [["R1",0,4],["R2",4,8]]
- Scheduled tasks
- [["T1","R1",0,4],["T2","R2",4,7],["T3","R2",7,8]]
- Unassigned task IDs
- []
- Completion hour
- 8
- Assigned resource-hours
- 8
Calculation method
Calculation method
Scheduled tasks
Earliest-deadline ready-task list scheduling; choose earliest feasible start then resource ID.
Unassigned task IDs
Report tasks that cannot fit or whose prerequisites are unresolved.
Completion hour
Maximum scheduled task end; zero for empty schedule.
Assigned resource-hours
Sum scheduled task durations.
Symbols and units
- a
- JSON Tasks [ID,duration hours,eligible resource IDs,release hour,deadline hour,predecessor IDs]
- b
- JSON Availability windows [resource ID,start hour,end hour]
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
- Task batching as nonpreemptive scheduling with context-specific resources/windows. Encode one resource per work context and explicitly block physically overlapping calendars; schedule groups by eligible contexts and reports overflow, without context-switch optimization. Supported limits: At most 50 tasks and 20 resources. One resource per task, no preemption. Heuristic may leave tasks unassigned despite an alternative feasible schedule; no optimality claim. Simultaneous panels must be predeclared as one composite resource with common availability. Travel/setup/buffers must be included in duration or blocked windows.
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.