Abstract
This paper studies the Quay Crane Scheduling Problem (QCSP). The QCSP determines how a number of quay cranes should be scheduled in order to service a vessel with minimum makespan. Previous work considers the QCSP to be a combinatorially hard problem. For that reason, the focus has been on developing efficient heuristics. Our study shows, however, that the QCSP is tractable in the realistic setting, where quay cranes can share the workload of bays. We introduce a novel linear time algorithm that solves the QCSP and prove its correctness.
This research is sponsored in part by the Danish Maritime Fund under grant no. 2021-069.
M. O. Herup and G. C. W. Thiesgaard—These authors contributed equally to this work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A hold is the part of a bay, which is under deck. In this context, a hold can be considered equivalent to a bay.
References
Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 12(4), 345–360 (2009)
Bierwirth, C., Meisel, F.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244(3), 675–689 (2015)
Daganzo, C.F.: The crane scheduling problem. Transp. Res. Part B: Methodol. 23(3), 159–175 (1989)
Fan, L., Low, M.Y.H., Ying, H.S., Jing, H.W., Min, Z., Aye, W.C.: Stowage planning of large containership with tradeoff between crane workload balance and ship stability. In: World Congress on Engineering 2012, 4–6 July 2012, London, UK, vol. 2182, pp. 1537–1543. International Association of Engineers (2010)
Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)
Jensen, R.M., Pacino, D., Ajspur, M.L., Vesterdal, C.: Container Vessel Stowage Planning. Weilbach, Copenhagen (2018)
Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752–768 (2004)
Lee, D.H., Wang, H.Q., Miao, L.: Quay crane scheduling with non-interference constraints in port container terminals. Transp. Res. Part E: Logist. Transp. Rev. 44(1), 124–135 (2008)
Moccia, L., Cordeau, J.F., Gaudioso, M., Laporte, G.: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Res. Logist. (NRL) 53(1), 45–59 (2006)
Psaraftis, H.N.: The future of maritime transport. In: Encyclopedia of Transportation. Elsevier (2020)
Sammarra, M., Cordeau, J.F., Laporte, G., Monaco, M.F.: A tabu search heuristic for the quay crane scheduling problem. J. Sched. 10(4), 327–336 (2007)
Sirimanne, S.N., et al.: Review of maritime transport 2020. In: United Nations Conference on Trade and Development (2020)
Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectr. 30(1), 1–52 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Herup, M.O., Thiesgaard, G.C.W., van Twiller, J., Jensen, R.M. (2022). A Linear Time Algorithm for Optimal Quay Crane Scheduling. In: de Armas, J., Ramalhinho, H., Voß, S. (eds) Computational Logistics. ICCL 2022. Lecture Notes in Computer Science, vol 13557. Springer, Cham. https://doi.org/10.1007/978-3-031-16579-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-16579-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16578-8
Online ISBN: 978-3-031-16579-5
eBook Packages: Computer ScienceComputer Science (R0)