Two very large-scale neighborhoods for single machine scheduling

Tobias Brueggemann*, Johann L. Hurink

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)
1 Downloads (Pure)

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 languageEnglish
Pages (from-to)513-533
Number of pages21
JournalOR Spectrum = OR Spektrum
Volume29
Issue number3
DOIs
Publication statusPublished - Jul 2007

Keywords

  • MSC-95B35
  • Local search
  • Single machine
  • Very large-scale neighborhoods

Fingerprint

Dive into the research topics of 'Two very large-scale neighborhoods for single machine scheduling'. Together they form a unique fingerprint.

Cite this