Parallel Job Load Planner
Allocate independent jobs to identical machines, inspect a concrete timeline and compare its makespan with a valid lower bound.
Loading tool…
How to use Parallel Job Load Planner
Choose entered order or sort by decreasing duration. Each next job goes onto the least-loaded machine, with machine order breaking ties. The export gives starts, finishes and a lower bound from the largest job and average total load.
- Enter job json (id, duration), identical machines.
- Choose the stated convention and check the units and supported model.
- Calculate, inspect the result, then copy or download it.
Good to know
- Exact-grid inputs are plain decimals with at most six places and magnitude≤1e9. Raw JSON number spelling is checked before conversion; decimal strings can preserve exact grid values. Exact rational intermediates are bounded to 8192 bits. Up to 200 positive-duration jobs and 20 identical machines, all available at time zero. No preemption, dependencies, release times, setups, deadlines or calendars. These are heuristics; optimality is only certified when the produced makespan equals the displayed mathematical lower bound. A larger gap is not an optimality gap certificate.
- Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.
- Educational user-assumption arithmetic only. No live prices, laws, tax rules, quotes or financial advice.
Common questions
Is longest-duration-first always optimal?
No. The schedule is a transparent heuristic for identical parallel machines. Equality with the displayed lower bound proves this particular schedule optimal; otherwise no such claim is made.
Is the input uploaded or saved?
No. The tool calculates inside this browser tab and provides a local download; it does not persist your input.
Keep going with related tools
All calculators →Project Critical Path Planner
Calculate earliest and latest task timing, exact total slack and critical connections in a task network.
CalculatorsSmall Exact Bin Packing Workbench
Allocate every small exact-size item into the fewest equal-capacity bins and export a checked packing witness.
CalculatorsBill of Materials Explosion Workbench
Expand multi-level product requirements through an exact acyclic component graph and inspect shared-component contributions.
CalculatorsAssembly Station Takt Auditor
Audit your task-to-station assignment against customer takt, with exact grouped work, bottleneck ties, precedence violations and a declared ideal pipeline capacity model.
CalculatorsCumulative Resource Capacity Auditor
Audit fixed task demands against an entered resource-capacity profile, retaining exact overload intervals and demand-duration conservation.
CalculatorsTwo-stage Flow Shop Workbench
Compare an entered job order with an exact two-stage makespan sequence and inspect both machine timelines.