Planning & productivity

Parallel task schedule planner

Schedule independent jobs across equal lanes and visualise elapsed time.

Parallel task schedule planner
Esc to restore

Your inputs

Comma-separated headings shown in the example. Up to 1,000 source rows; keep this project table small enough to review.

Up to 25 MB per file, 50,000 data rows, 200 columns and 2 million data cells. Fully blank rows and columns are ignored before row, column and cell limits are checked. Individual tools may have smaller result or chart limits.

Results update as you type. Larger files run when you press Update result.

Processed on your device

Your result

LOCAL & PRIVATE

Your result will appear here.

Your inputs stay in this browser. Nothing is uploaded or saved.

A clear answer. Here’s how.

Sorts tasks by duration descending and assigns each to the currently least-loaded lane, preserving input order for ties. Reports start/finish minutes from zero and overall makespan. Jobs are independent and cannot pause; no dependencies, setup times or staff constraints are modelled. This LPT heuristic is not always optimal. Up to 1,000 tasks; plot includes the first 100.

See a worked example

Worked example

A fixed demonstration, separate from the values you enter above.

Project CSV
Task,Minutes
Prepare A,35
Prepare B,20
Prepare C,15
Prepare D,10
Identical parallel lanes
2

Example result

Example result
TaskLaneStart minuteFinish minuteDuration
Prepare A103535
Prepare B202020
Prepare C2203515
Prepare D1354510

Longest-processing-time greedy schedule on identical lanes, starting at zero. Independent non-preemptive tasks only; no dependencies/setup times. Plot shows first 100 tasks. Makespan 45 minutes; heuristic is not always optimal.

Keep going.

Party seating allocationVolunteer role rotationRound-robin fixture makerKnockout bracket worksheet