Two very large-scale neighborhoods for single machine scheduling

Share/Save/Bookmark

Brueggemann, T. and Hurink, J.L. (2007) Two very large-scale neighborhoods for single machine scheduling. OR Spectrum, 29 (3). pp. 513-533. ISSN 0171-6468

[img]PDF
Restricted to UT campus only
: Request a copy
256Kb
Abstract:In this paper, the problem of minimizing the total completion time on a single machine with the presence of release dates is studied. We introduce two different approaches leading to very large-scale neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61758
Official URL:http://dx.doi.org/10.1007/s00291-006-0052-5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 241704