Abstract
This paper studies an online over-list model of the integrated allocation of berths and quay cranes in container terminals with 1-lookahead ability. The objective is to minimize the maximum completion time of container vessels, i.e., the makespan. We focus on two different types of vessels, three berths and a small number of QCs in the hybrid berth layout, with 1-lookahead information. We propose a -competitive algorithm for the case with 4 cranes and a -competitive algorithm for the case with 5 cranes, respectively. Both of the algorithms are proved to be optimal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 202(3), 615–627 (2010)
Blazewicz, J., Cheng, T.C.E., Machowiak, M., Oguz, C.: Berth and quay crane allocation: a moldable task scheduling model. Journal of The Operational Research Society 62, 1189–1197 (2011)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)
Carlo, H., Vis, I., Roodbergen, K.: Seaside operations in container terminals: literature overview, trends, and research directions. Flexible Services and Manufacturing Journal, 1–39 (2013)
Chen, J.H., Lee, D.H., Cao, J.X.: A combinatorial benders cuts algorithm for the quayside operation problem at container terminals. Transportation Research Part E: Logistics and Transportation Review 48(1), 266–275 (2012), select Papers from the 19th International Symposium on Transportation and Traffic Theory
Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological 44(2), 232–245 (2010)
Imai, A., Sun, X., Nishimura, E., Papadimitriou, S.: Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B: Methodological 39(3), 199–221 (2005)
Liang, C., Guo, J., Yang, Y.: Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. Journal of Intelligent Manufacturing 22(3), 471–479 (2011)
Lokuge, P., Alahakoon, D.: Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents. European Journal of Operational Research 177(3), 1985–2015 (2007)
Mandelbaum, M., Shabtay, D.: Scheduling unit length jobs on parallel machines with lookahead information. Journal of Scheduling 14(4), 335–350 (2011)
Park, Y.M., Kim, K.H.: A scheduling method for berth and quay cranes. OR Spectrum 25(1), 1–23 (2003)
Zhang, L., Khammuang, K., Wirth, A.: On-line scheduling with non-crossing constraints. Operations Research Letters 36(5), 579–583 (2008)
Zhen, L., Chew, E.P., Lee, L.H.: An integrated model for berth template and yard template planning in transshipment hubs. Transportation Science 45(4), 483–504 (2011)
Zheng, F., Cheng, Y., Liu, M., Xu, Y.: Online interval scheduling on a single machine with finite lookahead. Computers & Operations Research 40(1), 180–191 (2013)
Zheng, F., Qiao, L., Liu, M., Chu, C.: Online integrated allocation for small numbers of berths and quay cranes in container terminals (working paper)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pan, J., Xu, Y. (2015). Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)