| Tartalom: |
http://eprints.sztaki.hu/6673/ |
| Archívum: |
SZTAKI Repozitórium |
| Gyűjtemény: |
Status = Published
Type = ISI Article
|
| Cím: |
A cutting plane approach for integrated planning and scheduling
|
| Létrehozó: |
Kis, Tamás
Kovács, András
|
| Dátum: |
2012
|
| Téma: |
QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
|
| Tartalmi leírás: |
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. © 2011 Elsevier Ltd.
|
| Típus: |
ISI Article
PeerReviewed
|
| Azonosító: |
Kis, Tamás and Kovács, András (2012) A cutting plane approach for integrated planning and scheduling. COMPUTERS & OPERATIONS RESEARCH, 39 (2). pp. 320-327. ISSN 0305-0548 10.1016/j.cor.2011.04.006 < http://dx.doi.org/10.1016/j.cor.2011.04.006>
|
| Kapcsolat: |
10.1016/j.cor.2011.04.006
|
