View the model
Download the model

Given:
-A set of tasks, each with a task time,
-Precedence constraints among some of the tasks,
-A limited number of stations;

Problem:
-Minimize the maximum amount of work assigned to any station, subject to:
--Each task is assigned to exactly one station,
--No task is assigned to an earlier station than any of its predecessors;