Optimization Online


Reclaimer Scheduling: Complexity and Algorithms

Enrico Angelelli(angele***at***eco.unibs.it)
Thomas Kalinowski(thomas.kalinowski***at***newcastle.edu.au)
Reena Kapoor(reena.kapoor***at***uon.edu.au)
Martin Savelsbergh(martin.savelsbergh***at***newcastle.edu.au)

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.

Keywords: reclaimer scheduling, stockyard management, approximation algorithm, complexity

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Combinatorial Optimization (Approximation Algorithms )


Download: [PDF]

Entry Submitted: 02/17/2014
Entry Accepted: 02/17/2014
Entry Last Modified: 02/17/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society