A reclaimer scheduling problem arising in coal stockyard management

Author(s)
Angelelli, Enrico
Kalinowski, Thomas
Kapoor, Reena
Savelsbergh, Martin W P
Publication Date
2016-10
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.
Citation
Journal of Scheduling, 19(5), p. 563-582
ISSN
1099-1425
1094-6136
Link
https://hdl.handle.net/1959.11/26792
Publisher
Springer New York LLC
Title
A reclaimer scheduling problem arising in coal stockyard management
Type of document
Journal Article
Entity Type
Publication

Files:

NameSizeformatDescriptionLink