Two very large-scale neighborhoods for single machine scheduling

Tobias Brueggemann; Johann L. Hurink

doi:10.1007/s00291-006-0052-5

Two very large-scale neighborhoods for single machine scheduling

Tobias Brueggemann^*, Johann L. Hurink

^*Corresponding author for this work

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

13 Citations (Scopus)

6 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 language	English
Pages (from-to)	513-533
Number of pages	21
Journal	OR Spectrum = OR Spektrum
Volume	29
Issue number	3
DOIs	https://doi.org/10.1007/s00291-006-0052-5
Publication status	Published - Jul 2007

Keywords

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

Access to Document

10.1007/s00291-006-0052-5

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, Very large-scale neighborhoods",

author = "Tobias Brueggemann and Hurink, {Johann L.}",

note = "10.1007/s00291-006-0052-5 ",

year = "2007",

month = jul,

doi = "10.1007/s00291-006-0052-5",

language = "English",

volume = "29",

pages = "513--533",

journal = "OR Spectrum = OR Spektrum",

issn = "0171-6468",

publisher = "Springer",

number = "3",

}

TY - JOUR

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

AU - Brueggemann, Tobias

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 - Very large-scale neighborhoods

U2 - 10.1007/s00291-006-0052-5

DO - 10.1007/s00291-006-0052-5

M3 - Article

SN - 0171-6468

VL - 29

SP - 513

EP - 533

JO - OR Spectrum = OR Spektrum

JF - OR Spectrum = OR Spektrum

IS - 3

ER -

Two very large-scale neighborhoods for single machine scheduling

Abstract

Keywords

Access to Document

Fingerprint

Cite this