An linear programming based lower bound for the simple assembly line balancing problem

The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requiring a number of time units, must be assigned to workstations without exceeding the cycle time. We present a new lower bound, namely the LP relaxation of an integer programming formulation based on Dantzig

• Type: Journal
• Year: 2006
• Where: EOR
• Authors: Marc Peeters, Zeger Degraeve
• Keywords: EOR 2006, Integer Programming, Integer Programming Problem, Lower Bound