# A reclaimer scheduling problem arising in coal stockyard management

arXiv: https://arxiv.org/abs/1402.4178 · HTML: https://mlsanity.com/paper/1402.4178/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Feb 2014.

## Built on by (most cited first, 1 of 1)

- [A Constraint Programming Model for Scheduling the Unloading of Trains in Ports: Extended](https://mlsanity.com/paper/2312.13682/) (2023)

## Abstract (arXiv)

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.