| Article ID: | iaor20163648 |
| Volume: | 19 |
| Issue: | 5 |
| Start Page Number: | 563 |
| End Page Number: | 582 |
| Publication Date: | Oct 2016 |
| Journal: | Journal of Scheduling |
| Authors: | Savelsbergh Martin, Angelelli Enrico, Kapoor Reena, Kalinowski Thomas |
| Keywords: | combinatorial optimization, inventory, inventory: storage, management, supply & supply chains, heuristics |
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.