Examples
Examples
Try the starting example
- Tasks JSON [ID,duration seconds,predecessor IDs] in priority order
- [["A",30,[]],["B",20,["A"]],["C",40,["A"]],["D",10,["B","C"]]]
- Target station cycle (seconds)
- 60
- Stations [task IDs,total seconds]
- [[["A","B"],50],[["C","D"],50]]
- Station count
- 2
- Balance loss (%)
- 16.666667
Try another scenario
- Tasks JSON [ID,duration seconds,predecessor IDs] in priority order
- [["A",30,[]],["B",20,["A"]],["C",40,["A"]],["D",10,["B","C"]]]
- Target station cycle (seconds)
- 50
- Stations [task IDs,total seconds]
- [[["A","B"],50],[["C","D"],50]]
- Station count
- 2
- Balance loss (%)
- 0
Calculation method
Calculation method
Stations [task IDs,total seconds]
Fill each station with first eligible input-order task that fits; successors may follow predecessors in same station.
Station count
Count constructed groups.
Balance loss (%)
100*(stations*cycle-sumDurations)/(stations*cycle).
Symbols and units
- a
- Tasks JSON [ID,duration seconds,predecessor IDs] in priority order
- b
- Target station cycle (seconds)
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
- Precedence-respecting constructive line balance, no minimum-station guarantee. Each task indivisible; no resource sharing, ergonomics or skills model. Supported limits: 1..100 unique tasks; DAG, known predecessors; duration>0 and <=cycle.
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
Background reading; this does not imply endorsement or independent review of SumFizz.