Sciweavers

Share
EOR
2006

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

8 years 3 months ago
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
Marc Peeters, Zeger Degraeve
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where EOR
Authors Marc Peeters, Zeger Degraeve
Comments (0)
books