A reclaimer scheduling problem arising in coal stockyard management
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.
KeywordsReclaimer scheduling Stockyard management Approximation algorithm Complexity
This research was supported by the ARC Linkage Grant nos. LP1102000524 and HVCCC P/L.
- Kim, K. Y., & Kim, K. H. (1999). A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics, 59(1), 425–433.Google Scholar
- D. Sun, L. Tang, Benders approach for the raw material transportation scheduling problem in steel industry, in 2013 10th IEEE International Conference on Control and Automation (ICCA), pp. 481–484Google Scholar