Back to University of Twente portal
Matching based very large-scale neighborhoods for parallel machine scheduling
Brueggemann, Tobias and Hurink, Johann L. (2011) Matching based very large-scale neighborhoods for parallel machine scheduling. Journal of Heuristics, 17 (6). pp. 637-658. ISSN 1381-1231
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 882Kb |
| Abstract: | In this paper we study very large-scale neighborhoods for the minimum total weighted completion time problem on parallel machines, which is known to be strongly NP-hard. We develop two different ideas leading to very large-scale neighborhoods in which the best improving neighbor can be determined by calculating a weighted matching. The first neighborhood is introduced in a general fashion using combined operations of a basic neighborhood. Several examples for basic neighborhoods are given. The second approach is based on a partitioning of the job sets on the machines and a reassignment of them. In a computational study we evaluate the possibilities and the limitations of the presented very large-scale neighborhoods. |
| Item Type: | Article |
| Copyright: | © 2011 The Author(s) |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/78565 |
| Official URL: | http://dx.doi.org/10.1007/s10732-010-9149-8 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page