Two very large-scale neighborhoods for single machine scheduling

T. Brueggemann, Johann L. Hurink

Research output: Contribution to journalArticleAcademicpeer-review

6 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

@article{ff81f31f5e98466196c0abbbe973ca73,
title = "Two very large-scale neighborhoods for single machine scheduling",
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.",
keywords = "MSC-95B35, Local search, Single machine, IR-61758, EWI-10316, METIS-241704, Very large-scale neighborhoods",
author = "T. Brueggemann and Hurink, {Johann L.}",
note = "10.1007/s00291-006-0052-5",
year = "2007",
month = "7",
doi = "10.1007/s00291-006-0052-5",
language = "Undefined",
volume = "29",
pages = "513--533",
journal = "OR Spectrum = OR Spektrum",
issn = "0171-6468",
publisher = "Springer",
number = "SINTEF A13/3",

}

Two very large-scale neighborhoods for single machine scheduling. / Brueggemann, T.; Hurink, Johann L.

In: OR Spectrum = OR Spektrum, Vol. 29, No. SINTEF A13/3, 10.1007/s00291-006-0052-5, 07.2007, p. 513-533.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Two very large-scale neighborhoods for single machine scheduling

AU - Brueggemann, T.

AU - Hurink, Johann L.

N1 - 10.1007/s00291-006-0052-5

PY - 2007/7

Y1 - 2007/7

N2 - 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.

AB - 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.

KW - MSC-95B35

KW - Local search

KW - Single machine

KW - IR-61758

KW - EWI-10316

KW - METIS-241704

KW - Very large-scale neighborhoods

U2 - 10.1007/s00291-006-0052-5

DO - 10.1007/s00291-006-0052-5

M3 - Article

VL - 29

SP - 513

EP - 533

JO - OR Spectrum = OR Spektrum

JF - OR Spectrum = OR Spektrum

SN - 0171-6468

IS - SINTEF A13/3

M1 - 10.1007/s00291-006-0052-5

ER -