Two very large-scale neighborhoods for single machine scheduling

T. Brueggemann, Johann L. Hurink

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

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.
Original languageUndefined
Article number10.1007/s00291-006-0052-5
Pages (from-to)513-533
Number of pages21
JournalOR Spectrum = OR Spektrum
Volume29
Issue numberSINTEF A13/3
DOIs
Publication statusPublished - Jul 2007

Keywords

  • MSC-95B35
  • Local search
  • Single machine
  • IR-61758
  • EWI-10316
  • METIS-241704
  • Very large-scale neighborhoods

Cite this