# Scheduling reclaimers serving a stock pad at a coal terminal

Article

First Online:

## Abstract

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.

## Keywords

Reclaimer scheduling Stockyard management Approximation algorithm Computational complexity Branch-and-bound## References

- 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. - Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals.
*European Journal of Operational Research*,*202*(3), 615–627.CrossRefGoogle Scholar - Hu, D., & Yao, Z. (2012). Stacker-reclaimer scheduling in a dry bulk terminal.
*International Journal of Computer Integrated Manufacturing*,*25*(11), 1047–1058.CrossRefGoogle Scholar - 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 - Kim, K., & Kim, K. (2003). Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals.
*Naval Research Logistics (NRL)*,*50*(5), 498–514.CrossRefGoogle Scholar - Legato, P., Trunfio, R., & Meisel, F. (2012). Modeling and solving rich quay crane scheduling problems.
*Computers and Operations Research*,*39*(9), 2063–2078.CrossRefGoogle Scholar - Makarychev, Y. (2014). Another variant of partition. Theoretical Computer Science Stack Exchange. http://cstheory.stackexchange.com/q/22340 (version:2014-04-29).
- Ng, W. (2005). Crane scheduling in container yards with inter-crane interference.
*European Journal of Operational Research*,*164*(1), 64–78.CrossRefGoogle Scholar - Ng, W., & Mak, K. (2005a). An effective heuristic for scheduling a yard crane to handle jobs with different ready times.
*Engineering Optimization*,*37*(8), 867–877.CrossRefGoogle Scholar - Ng, W., & Mak, K. (2005b). Yard crane scheduling in port container terminals.
*Applied Mathematical Modelling*,*29*(3), 263–276.CrossRefGoogle Scholar - 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 - Zhang, C., Wan, Y.-W., Liu, J., & Linn, R. J. (2002). Dynamic crane deployment in container storage yards.
*Transportation Research Part B: Methodological*,*36*(6), 537–555.CrossRefGoogle Scholar

## Copyright information

© Springer Science+Business Media New York 2016