Examples
Examples
Try the starting example
- Task groups JSON [ID,item count,one-way carry m,handling min/item,travel min/m including return,crew per group]
- [["A",10,20,1,0.05,2],["B",5,10,2,0.1,1]]
- Available crew members (people)
- 3
- Crew paid concurrently for whole makespan (people; 0=omit idle estimate)
- 3
- Hands-on crew labor (person-hours)
- 0.916667
- Task schedule [ID,crew member IDs,start min,end min]
- [["A",[1,2],0,20],["B",[3],0,15]]
- Elapsed makespan (hours)
- 0.333333
- Paid idle person-hours under supplied paid crew
- 0.083333
Try another scenario
- Task groups JSON [ID,item count,one-way carry m,handling min/item,travel min/m including return,crew per group]
- [["A",10,20,1,0.05,2],["B",5,10,2,0.1,1]]
- Available crew members (people)
- 2
- Crew paid concurrently for whole makespan (people; 0=omit idle estimate)
- 2
- Hands-on crew labor (person-hours)
- 0.916667
- Task schedule [ID,crew member IDs,start min,end min]
- [["A",[1,2],0,20],["B",[1],20,35]]
- Elapsed makespan (hours)
- 0.583333
- Paid idle person-hours under supplied paid crew
- 0.25
Calculation method
Calculation method
Hands-on crew labor (person-hours)
For each group duration=count*(handling+distance*travelCoefficient); sum duration*requiredCrew/60.
Task schedule [ID,crew member IDs,start min,end min]
In input order choose required crew with earliest available times, then start at latest free time among chosen members; mark them occupied.
Elapsed makespan (hours)
Latest crew end minute/60.
Paid idle person-hours under supplied paid crew
paidCrew*makespanHours-handsOnPersonHours; 0 input means omit and output 0.
Symbols and units
- a
- Task groups JSON [ID,item count,one-way carry m,handling min/item,travel min/m including return,crew per group]
- b
- Available crew members (people)
- c
- Crew paid concurrently for whole makespan (people; 0=omit idle estimate)
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
- Measured-duration group scheduling heuristic; crew members interchangeable, one group runs sequentially within itself. Distance coefficient must include actual return/walking policy. No lifting limits, productivity norms or labor-law rules assumed. Supported limits: 1..100 groups, integer count>=1, crew>=1 and <=availableCrew; times nonnegative, group duration>0; paidCrew=0 or >=availableCrew.
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.