Abstract
This paper considers the problem of scheduling quay cranes which are used at sea port container terminals to load and unload containers. This problem is studied intensively in a recent stream of research but still lacks a correct treatment of crane interference constraints. We present a revised optimization model for the scheduling of quay cranes and propose a heuristic solution procedure. At its core a Branch-and-Bound algorithm is applied for searching a subset of above average quality schedules. The heuristic takes advantage from efficient criteria for branching and bounding the search with respect to the impact of crane interference. Although the used techniques are quite standard, the new heuristic produces much better solutions in considerably shorter run times than all algorithms known from the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bierwirth, C., & Meisel, F. (2009). A survey of berth allocation and quay crane scheduling problems in container terminals (Working paper). Martin-Luther-University Halle-Wittenberg, submitted for publication.
Daganzo, C. F. (1989). The crane scheduling problem. Transportation Research Part B, 23(3), 159–175.
Kim, K. H., & Park, Y. M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3), 752–768.
Lim, A., Rodrigues, B., Xiao, F., & Zhu, Y. (2004). Crane scheduling with spatial constraints. Naval Research Logistics, 51(3), 386–406.
Lim, A., Rodrigues, B., & Xu, Z. (2007). A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics, 54(2), 115–127.
Liu, J., Wan, Y.-W., & Wang, L. (2006). Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Research Logistics, 53(1), 60–74.
Meersmans, P. J. M., & Dekker, R. (2001). Operations research supports container handling (Econometric Institute Report 234). Erasmus University Rotterdam.
Moccia, L., Cordeau, J.-F., Gaudioso, M., & Laporte, G. (2006). A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics, 53(1), 45–59.
Peterkofsky, R. I., & Daganzo, C. F. (1990). A branch and bound solution method for the crane scheduling problem. Transportation Research Part B, 24(3), 159–172.
Pinedo, M. (2002). Scheduling—theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall.
Sammarra, M., Cordeau, J.-F., Laporte, G., & Monaco, M. F. (2007). A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling, 10(4–5), 327–336.
Stahlbock, R., & Voß, S. (2008). Operations research at container terminals: a literature update. OR Spectrum, 30(1), 1–52.
Steenken, D., Winter, T., & Zimmermann, U. T. (2001). Stowage and transport optimization in ship planning. In M. Grötschel, S. Krumke, & J. Rambau (Eds.), Online optimization of large scale systems (pp. 731–745). Berlin: Springer.
Vis, I. F. A., & de Koster, R. (2003). Transshipment of containers at a container terminal: an overview. European Journal of Operational Research, 147(1), 1–16.
Winter, T. (1999). Online and real-time dispatching problems. PhD thesis, Technical University Braunschweig.
Zhu, Y., & Lim, A. (2006). Crane scheduling with non-crossing constraint. Journal of the Operational Research Society, 57(12), 1464–1471.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bierwirth, C., Meisel, F. A fast heuristic for quay crane scheduling with interference constraints. J Sched 12, 345–360 (2009). https://doi.org/10.1007/s10951-009-0105-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0105-0