Camp arrival setup sequence calculator

Calculate setup schedule [task,helper,start min,end min] and setup makespan with your own figures.

Your numbers

Use the units shown. Results update as you change valid inputs.

Use setup schedule [task,helper,start min,end min] and setup makespan to compare changes to your inputs. The method and limits below explain the scope.

Examples

Examples

Try the starting example

Setup tasks JSON [ID,duration minutes,predecessor IDs] in priority order
[["tent",20,[]],["beds",10,["tent"]],["table",10,[]],["cook",15,["table"]]]
Helpers (people)
2
Daylight remaining from arrival (min)
45
Setup schedule [task,helper,start min,end min]
[["tent",1,0,20],["beds",1,20,30],["table",2,0,10],["cook",2,10,25]]
Setup makespan (min)
30
Daylight cutoff slack (min)
15
Cutoff status
Within cutoff

Try another scenario

Setup tasks JSON [ID,duration minutes,predecessor IDs] in priority order
[["tent",20,[]],["beds",10,["tent"]],["table",10,[]],["cook",15,["table"]]]
Helpers (people)
1
Daylight remaining from arrival (min)
45
Setup schedule [task,helper,start min,end min]
[["tent",1,0,20],["beds",1,20,30],["table",1,30,40],["cook",1,40,55]]
Setup makespan (min)
55
Daylight cutoff slack (min)
-10
Cutoff status
Past cutoff
Calculation method

Calculation method

Setup schedule [task,helper,start min,end min]

Choose first topologically ready task in input order. Assign helper with earliest feasible start after predecessor finishes; tie helper index.

Setup makespan (min)

Latest scheduled end.

Daylight cutoff slack (min)

daylightRemaining-makespan.

Cutoff status

Within cutoff if makespan<=daylightRemaining; otherwise Past cutoff.

Symbols and units
a
Setup tasks JSON [ID,duration minutes,predecessor IDs] in priority order
b
Helpers (people)
c
Daylight remaining from arrival (min)

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

  • One helper per indivisible task, interchangeable helpers, explicit dependencies. Greedy list schedule, not guaranteed minimum makespan. Cutoff entirely user supplied, no camping safety assurance. Supported limits: 1..100 unique tasks, positive minutes; acyclic known predecessors; helpers integer 1..100; daylight>=0.
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.

Share this page
Share this calculator

Leave unchecked to share the page without your entered values.