# Assembly line balancing problem

A combinatorial program. An assembly line consists of $LaTeX: m$ work stations, connected by a conveyor belt. Each station performs a set of tasks that takes a cycle time, $LaTeX: c$. Each task must be assigned to exactly one station such that precedence constraints are satisfied. One model minimizes the total cycle time, given the number of stations. Another minimizes the number of stations, given the maximum allowable cycle time. There are variants of this simple form.