Abstract
High utilization of quay cranes is a major objective pursued by seaport terminal managers. Double-cycling technique has been shown to be effective in practice. Complicated with reshuffle operations, the productivity of quay cranes could be further improved, but the problem complexity increases as a side-effect. This paper studies a double-cycling quay crane scheduling problem in which reshuffle containers can be handled internally on the vessel. For this problem, no exact algorithm exists in the literature. We present a dynamic programming approach to optimally solve the problem. Our algorithm runs in polynomial time when the number of container stacks is fixed. We also extend our proposed optimal algorithm to the general case where hatch covers are involved.
Similar content being viewed by others
References
Bauer M (2016) Entwurf und experimentelle Analyse von Lösungsverfahren für das Container Sequencing Problem, Ph.D. Dissertation, Universität Passau, pp 88–132
Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12(4):345–360
Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3):615–627
Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675–689
Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 272(2):224–262
Caserta M, Schwarze S, Voß S (2011) Container rehandling at maritime container terminals. In: Bose JW (ed) Handbook of terminal planning. Springer, Berlin, pp 247–269
Choo S, Klabjan D, Simchi-Levi D (2010) Multiship crane sequencing with yard congestion constraints. Transp Sci 44(1):98–115
Daganzo CF (1989) Crane productivity and ship delay in ports. Transp Res Rec 1251:1–9
Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp Sci 40(4):473–483
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1:61–68
Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32(4):701–711
Kim KH, Hong G-P (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940–954
Kim KH, Park Y-M (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3):752–768
Lee CY, Liu M, Chu CB (2015) Optimal algorithm for general quay crane double-cycling problem. Transp Sci 49(4):957–967
Legato P, Trunfio R, Meisel F (2012) Modeling and solving rich quay crane scheduling problems. Comput Oper Res 39(9):2063–2078
Lim A, Rodrigues B, Xu Z (2007) A m-parallel crane scheduling problem with a non-crossing constraint. Naval Res Logist 54(2):115–127
Liu M, Chu F, Zhang ZZ, Chu CB (2015a) A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations. Transp Res Part E 81:52–74
Liu M, Zheng FF, Li JF (2015b) Scheduling small number of quay cranes with non-interference constraint. Optim Lett 9(2):403–412
Meisel F (2011) The quay crane scheduling problem with time windows. Naval Res Logist 58(7):619–639
Meisel F, Wichmann M (2010) Container sequencing for quay cranes with internal reshuffles. OR Spectr 32(3):569–591
Meisel F, Bierwirth C (2011) A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput Oper Res 38(3):683–693
Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp Sci 47(2):131–147
Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1):1–52
Zhang HP, Kim KH (2009) Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput Ind Eng 56(3):979–992
Zhang A, Zhang WS, Chen Y, Chen GT, Chen XF (2017) Approximate the scheduling of quay cranes with non-crossing constraints. Eur J Oper Res 258(3):820–828
Acknowledgements
We would like to thank the anonymous referees for their constructive suggestions! The authors would also like to thank Prof. Chung-Yee Lee for his sharp and constructive comments! This work was supported by the National Natural Science Foundation of China (Grant Nos. 71531011, 71832001, 71771048 and 71571134). The work was also the Fundamental Research Funds for the Central Universities.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zheng, F., Pang, Y., Liu, M. et al. Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles. J Comb Optim 39, 708–724 (2020). https://doi.org/10.1007/s10878-019-00508-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00508-9