Scheduling reclaimers serving a stock pad at a coal terminal
- 186 Downloads
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.
KeywordsReclaimer scheduling Stockyard management Approximation algorithm Computational complexity Branch-and-bound
- Angelelli, E., Kalinowski, T., Kapoor, R., & Savelsbergh, M. (2015). A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling. In press. doi:10.1007/s10951-015-0436-y.
- Kim, K., & Kim, K. (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
- Makarychev, Y. (2014). Another variant of partition. Theoretical Computer Science Stack Exchange. http://cstheory.stackexchange.com/q/22340 (version:2014-04-29).
- Sun, D., & Tang, L.(2013). Benders approach for the raw material transportation scheduling problem in steel industry. In 10th IEEE international conference on control and automation (ICCA) (pp. 481–484).Google Scholar