Scheduling reclaimers serving a stock pad at a coal terminal

Thomas Kalinowski (), Reena Kapoor and Martin W. P. Savelsbergh
Additional contact information
Thomas Kalinowski: University of Newcastle
Reena Kapoor: University of Newcastle
Martin W. P. Savelsbergh: Georgia Institute of Technology

Journal of Scheduling, 2017, vol. 20, issue 1, No 7, 85-101

Abstract: Abstract We study a variant of an abstract scheduling problem inspired by the management of reclaimers in the stockyard of a coal export terminal. We prove NP-completeness of the problem and formulate it as a mixed-integer program. We show that for a given reclaiming sequence, the problem can be solved in pseudo-polynomial time. In addition, we provide simple, constant-factor approximation algorithms as well as exact branch-and-bound algorithms. An extensive computational study analyzes the performance of the algorithms.

Keywords: Reclaimer scheduling; Stockyard management; Approximation algorithm; Computational complexity; Branch-and-bound (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-016-0495-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:1:d:10.1007_s10951-016-0495-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-016-0495-8

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().