Abstract
Minimizing total tardiness on identical parallel machines is an NP-hard parallel machine scheduling problem that has received much attention in literature due to its direct application to real-world applications. For solving this problem, we present a variable neighbourhood search that incorporates a learning mechanism for guiding the search. Computational results comparing with the best approaches for this problem reveals that our algorithm is a suitable alternative to efficiently solve this problem.
Original language | English |
---|---|
Title of host publication | Learning and Intelligent Optimization |
Subtitle of host publication | 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers |
Editors | Clarisse Dhaenens, Laetitia Jourdan, Marie-Eléonore Marmion |
Place of Publication | Cham |
Publisher | Springer |
Pages | 119-124 |
Number of pages | 6 |
ISBN (Electronic) | 978-3-319-19084-6 |
ISBN (Print) | 978-3-319-19083-9 |
DOIs | |
Publication status | Published - 29 May 2015 |
Event | 9th International Conference on Learning and Intelligent Optimization, LION 2015 - Lille, France Duration: 12 Jan 2015 → 15 Jan 2015 Conference number: 9 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Volume | 8994 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 9th International Conference on Learning and Intelligent Optimization, LION 2015 |
---|---|
Abbreviated title | LION |
Country/Territory | France |
City | Lille |
Period | 12/01/15 → 15/01/15 |