Ship Stability Considerations in the Quay Crane Scheduling Problem

  • Noura Al-DhaheriEmail author
Part of the Intelligent Systems Reference Library book series (ISRL, volume 131)


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.


  1. 1.
    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)Google Scholar
  2. 2.
    Al-Dhaheri, N., Diabat, A.: The quay crane scheduling problem. J. Manuf. Syst. 36, 87–94 (2015)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Alzaabi, S., Diabat, A.: On the berth allocation problem. RAIRO Oper. Res. 50(3), 491–501 (2016)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115–123 (2014)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Imai, A., Nishimura, E., Papadimitriou, S.: Berth allocation with service priority. Transp. Res. Part B: Methodol. 37(5), 437–457 (2003)Google Scholar
  12. 12.
    Kenan, N., Diabat, A.: A branch-and-price algorithm to solve a quay crane scheduling problem. Proc. Comput. Sci. 61, 527–532 (2015)Google Scholar
  13. 13.
    Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752–768 (2004)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Meisel, F.: The quay crane scheduling problem with time windows. Naval Res. Logist. (NRL) 53(1), 45–59Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    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, SpainGoogle Scholar
  20. 20.
    Simrin, A., Diabat, A.: The dynamic berth allocation problem: a linearized formulation. RAIRO Oper. Res. 49(3), 473–494 (2015)Google Scholar
  21. 21.
    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)Google Scholar
  22. 22.
    Theodorou, E., Diabat, A.: A joint quay crane assignment and scheduling problem: Formulation, solution algorithm and computational results. Optim. Lett. 9, 799–817 (2015)Google Scholar
  23. 23.
    Vo, S., Stahlbock, R., Steenken, D.: Container terminal operation and operations research—a classification and literature review. OR Spectrum 26(1), 3–49 (2004)Google Scholar
  24. 24.
    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)Google Scholar
  25. 25.
    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)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Maqta Gateway, Abu Dhabi PortsAbu DhabiUnited Arab Emirates

Personalised recommendations