The greedy pass packs tasks in fixed order without exceeding the cycle time.

highlighted = computed this step

Station one

Station one gets A and B with load 3.

station one load=3\text{station one load}=3
Station packingThe chart packs tasks in fixed order under the cycle-time cap.station packingcycle time 480 / 120 = 4 min/unitstation 1A 1B 2idle 13station 2C 3idle 13station 3D 2idle 22stationtasksloadidle1A+B312C313D22total work 8; idle 4; efficiency 2/3

Station two

Task C would exceed station one, so station two gets C with load 3.

station two load=3\text{station two load}=3
Station packingThe chart packs tasks in fixed order under the cycle-time cap.station packingcycle time 480 / 120 = 4 min/unitstation 1A 1B 2idle 13station 2C 3idle 13station 3D 2idle 22stationtasksloadidle1A+B312C313D22total work 8; idle 4; efficiency 2/3

Station three

Task D goes to station three with load 2.

station three load=2\text{station three load}=2
Station packingThe chart packs tasks in fixed order under the cycle-time cap.station packingcycle time 480 / 120 = 4 min/unitstation 1A 1B 2idle 13station 2C 3idle 13station 3D 2idle 22stationtasksloadidle1A+B312C313D22total work 8; idle 4; efficiency 2/3