A reclaimer scheduling problem arising in coal stockyard management

Enrico Angelelli; Thomas Kalinowski; Reena Kapoor; Martin W P Savelsbergh

doi:10.1007/s10951-015-0436-y

A reclaimer scheduling problem arising in coal stockyard management

Enrico Angelelli
, Thomas Kalinowski
, Reena Kapoor
, Martin W P Savelsbergh

School of Science & Technology

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

43 Citations (Scopus)

Abstract

We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

Original language	English
Pages (from-to)	563-582
Journal	Journal of Scheduling
Volume	19
Issue number	5
Early online date	10 Jun 2015
DOIs	https://doi.org/10.1007/s10951-015-0436-y
Publication status	Published - Oct 2016

Access to Document

10.1007/s10951-015-0436-y

https://hdl.handle.net/1959.11/26792

Handle.net

Persistent link

Cite this

@article{00c539faffcf446786f6456e42cd4e20,

title = "A reclaimer scheduling problem arising in coal stockyard management",

abstract = "We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.",

author = "Enrico Angelelli and Thomas Kalinowski and Reena Kapoor and Savelsbergh, \{Martin W P\}",

year = "2016",

month = oct,

doi = "10.1007/s10951-015-0436-y",

language = "English",

volume = "19",

pages = "563--582",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer New York LLC",

number = "5",

}

TY - JOUR

T1 - A reclaimer scheduling problem arising in coal stockyard management

AU - Angelelli, Enrico

AU - Kalinowski, Thomas

AU - Kapoor, Reena

AU - Savelsbergh, Martin W P

PY - 2016/10

Y1 - 2016/10

N2 - We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

AB - We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.

U2 - 10.1007/s10951-015-0436-y

DO - 10.1007/s10951-015-0436-y

M3 - Article

SN - 1094-6136

VL - 19

SP - 563

EP - 582

JO - Journal of Scheduling

JF - Journal of Scheduling

IS - 5

ER -

A reclaimer scheduling problem arising in coal stockyard management

Abstract

Access to Document

Handle.net

Fingerprint

Cite this