Lotsizing and scheduling on parallel machines with sequence-dependent setup costs

Industrial lotsizing and scheduling pose very difficult analytical problems . We propose an unconventional model that deals with sequence-dependent set up costs in a multiple-machine environment. The sequence-splitting model sp lits an entire schedule into subsequences, leading to tractable subproblems . An optimization approach based on a column generation/branch and bound me thodology is developed and heuristically adapted to test problems including five real-world problem instances gathered from industry.