A simple assembly line balancing problem (SALBP) assigns tasks to one-sided workstations on a serial line producing one product. Given task times, precedence constraints, cycle time, and a workstation limit, the usual goal is minimizing the required workstations. section 6.6
A feasible assignment must:
- Assign every task to exactly one workstation. section 6.6
- Respect the precedence order between tasks. section 6.6
- Keep each workstation’s workload within cycle time C. section 6.6
Tabu-search solution
A tabu-search implementation loads task durations and precedence data, sets cycle time to 4, and searches for an improved assignment. One reported sequence uses five workstations with workloads [3, 3, 3, 3, 3].
