Abstract
In this work we tackle the parallel machine scheduling problem with identical machines to minimize the sum of weighted completion times. We study the set covering formulation for this problem that was introduced by van den Akker et al. [1], and improve the performance of their branch-and-price algorithm by a number of techniques, including zero-suppressed binary decision diagrams (ZDD) and stabilization. These techniques are sufficiently generic to be promising also for other scheduling problems.
Original language | English |
---|---|
Title of host publication | 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 99-103 |
Number of pages | 5 |
ISBN (Electronic) | 978-1-5090-3665-3 |
DOIs | |
Publication status | Published - Dec 2016 |
Externally published | Yes |
Event | 2016 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2016 - Bali, Indonesia Duration: 4 Dec 2016 → 7 Dec 2016 |
Conference
Conference | 2016 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2016 |
---|---|
Abbreviated title | IEEM 2016 |
Country/Territory | Indonesia |
City | Bali |
Period | 4/12/16 → 7/12/16 |