Article ID: | iaor20116246 |
Volume: | 39 |
Issue: | 2 |
Start Page Number: | 320 |
End Page Number: | 327 |
Publication Date: | Feb 2012 |
Journal: | Computers and Operations Research |
Authors: | Kis T, Kovcs A |
Keywords: | scheduling, combinatorial optimization, programming: mathematical |
In this paper we propose a branch‐and‐cut algorithm for solving an integrated production planning and scheduling problem in a parallel machine environment. The planning problem consists of assigning each job to a week over the planning horizon, whereas in the scheduling problem those jobs assigned to a given week have to be scheduled in a parallel machine environment such that all jobs are finished within the week. We solve this problem in two ways: (1) as a monolithic mathematical program and (2) using a hierarchical decomposition approach in which only the planning decisions are modeled explicitly, and the existence of a feasible schedule for each week is verified by using cutting planes. The two approaches are compared with extensive computational testing.