Abstract
The aim of this paper is to present the recent literature that has advanced in the field of maritime logistics, specifically with regards to the consideration of vessel stability during the process of unloading and/or loading containers onto vessels. This process is essentially known as the Quay Crane Scheduling Problem (QCSP) which determines the operational profile of each quay crane in terms of the container tasks and timing. The literature on this and other problems pertaining to quayside operational planning is presented, before introducing the works with a contribution in ship stability. The works are described with insights into their formulation and solution techniques, as well as their contribution to the literature. Most importantly, the results are discussed and directions are provided for future work in the area.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al Hammadi, J., Diabat, A.: An integrated berth allocation and yard assignment problem for bulk ports: formulation and case study. RAIRO Oper. Res. (2017) (in press)
Al-Dhaheri, N., Diabat, A.: The quay crane scheduling problem. J. Manuf. Syst. 36, 87–94 (2015)
Al-Dhaheri, N., Diabat, A.: A Lagrangian-relaxation-based heuristic for the multiship quay crane scheduling problem with ship stability constraints. Ann. Oper. Res. (2016)
Al-Dhaheri, N., Jebali, A., Diabat, A.: A simulation based Genetic Algorithm approach for the quay crane scheduling under uncertainty. Simul. Model. Pract. Theory 66, 122–138 (2016a)
Al-Dhaheri, N., Jebali, A., Diabat, A.: The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Comput. Ind. Eng. 94, 230–244 (2016b)
Alzaabi, S., Diabat, A.: On the berth allocation problem. RAIRO Oper. Res. 50(3), 491–501 (2016)
Arango, C., Corts, P., Onieva, L., Escudero, A.: Simulation-optimization models for the dynamic berth allocation problem. Comput. Aided Civil Infrastruct. Eng. 28(10), 769–779 (2013)
Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115–123 (2014)
Fu, YM., Diabat, A.: A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. 39(3–4), 1194–1201 (2015)
Fu, YM., Diabat, A., Tsai, IT.: A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst. Appl. 41(15), 6959–6965 (2014)
Imai, A., Nishimura, E., Papadimitriou, S.: Berth allocation with service priority. Transp. Res. Part B: Methodol. 37(5), 437–457 (2003)
Kenan, N., Diabat, A.: A branch-and-price algorithm to solve a quay crane scheduling problem. Proc. Comput. Sci. 61, 527–532 (2015)
Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752–768 (2004)
Liang, C., Huang, Y., Yang, Y.: A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Ind. Eng. 56(3), 1021–1028 (2009)
Lu, Z., Han, X., Xi, L.: Simultaneous berth and quay crane allocation problem in container terminal. Adv. Sci. Lett. 4(6–7), 2113–2118 (2011)
Meisel, F.: The quay crane scheduling problem with time windows. Naval Res. Logist. (NRL) 53(1), 45–59
Moccia, L., Cordeau, JF., Gaudioso, M., Laporte, G.: A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Res. Logist. 53(1), 45–59 (2006)
Sammarra, M., Cordeau, JF., Laporte, G., Monaco, MF.: A Tabu search heuristic for the quay crane scheduling problem. J. Sched. 10(4–5), 327–336 (2007)
Schoonenberg, W., Hols, J., Diabat, A.: A cost based approach for a crane assignment and scheduling problem. In: International Conference on Industrial Engineering and Systems Management (IESM), 21–23 Oct 2015, Seville, Spain
Simrin, A., Diabat, A.: The dynamic berth allocation problem: a linearized formulation. RAIRO Oper. Res. 49(3), 473–494 (2015)
Simrin, A.S., Alkawaleet, N.N., Diabat, A.H.: A Lagrangian relaxation based Heuristic for the static berth allocation problem using the cutting plane method. In: Proceedings of the 15th International Conference on Enterprise Information Systems, pp. 565–569 (2013)
Theodorou, E., Diabat, A.: A joint quay crane assignment and scheduling problem: Formulation, solution algorithm and computational results. Optim. Lett. 9, 799–817 (2015)
Vo, S., Stahlbock, R., Steenken, D.: Container terminal operation and operations research—a classification and literature review. OR Spectrum 26(1), 3–49 (2004)
Wang, J., Hu, H., Song, Y.: Optimization of quay crane scheduling constrained by stability of vessels. Transp. Res. Rec.: J. Transp. Res. Board 2330(1), 47–54 (2013)
Zeng, Q., Diabat, A., Zhang, Q.: A simulation optimization approach for solving the dual-cycling problem in container terminals. Marit. Policy Manag. 42(8), 87–94 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Al-Dhaheri, N. (2018). Ship Stability Considerations in the Quay Crane Scheduling Problem. In: Konstantopoulos, C., Pantziou, G. (eds) Modeling, Computing and Data Handling Methodologies for Maritime Transportation. Intelligent Systems Reference Library, vol 131. Springer, Cham. https://doi.org/10.1007/978-3-319-61801-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-61801-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61800-5
Online ISBN: 978-3-319-61801-2
eBook Packages: EngineeringEngineering (R0)