The greedy pass packs tasks in fixed order without exceeding the cycle time.
Station one
Station one gets A and B with load 3.
station one load=3
Station two
Task C would exceed station one, so station two gets C with load 3.
station two load=3
Station three
Task D goes to station three with load 2.
station three load=2