Journal of Scheduling

, Volume 17, Issue 3, pp 289–303 | Cite as

The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions

  • Simon Emde
  • Nils BoysenEmail author
  • Dirk Briskorn


The berth allocation problem (BAP), which defines a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for efficiently operating a container port. In this paper, we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled floating platforms, which encase ships moored at the immobile quay and provide additional quay cranes for accelerating container processing. Furthermore, additional ships can be processed at the seaside of the platform, so that scarce berthing space at a terminal is enlarged. We formalize the BAP with mobile quay walls and provide suitable solution procedures.


Container logistics Berth allocation problem Mobile quay walls Branch-and-bound 


  1. Baird, A. J. (2006). Optimising the container transhipment hub location in northern Europe. Journal of Transport Geography, 14, 195–214.CrossRefGoogle Scholar
  2. Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202, 615–627.CrossRefGoogle Scholar
  3. Chae, J.-W., Park, W.-S., & Jeong, G. (2008). A hybrid quay wall proposed for a very large container ship in the west terminal of Busan new port. in International conference on coastal engineering in Hamburg, Germany.Google Scholar
  4. Chen, J. H., Lee, D.-H., & Cao, J.-X. (2011). Heuristics for quay crane scheduling at indented berth. Transportation Research Part E, 47, 1005–1020.Google Scholar
  5. Cheng, T. C. E., & Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271–292.Google Scholar
  6. Cordeau, J.-F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39, 526–538.CrossRefGoogle Scholar
  7. Drewry Shipping Consultants. (2006). Ship management. London: Drewry Shipping Consultants.Google Scholar
  8. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.Google Scholar
  9. Glover, F. (1977). Heuristic for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.CrossRefGoogle Scholar
  10. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Annals of Discrete Mathematics, 5, 287–326.CrossRefGoogle Scholar
  11. Huang, E. T., & Chen, H. C. (2003). Ship berthing at a floating pier. in Proceedings of the 13th international offshore and polar engineering conference (Vol. III, pp. 683–690).Google Scholar
  12. Imai, A., Nishimura, E., Hattori, M., & Papadimitriou, S. (2007). Berth allocation at indented berths for megacontainerships. European Journal of Operational Research, 179, 579–593.Google Scholar
  13. Imai, A., Nishimura, E., & Papadimitriou, S. (2008). Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E, 44, 136–151.CrossRefGoogle Scholar
  14. Jackson, J. R. (1956). A computing procedure for a line balancing problem. Management Science, 2, 261–271.CrossRefGoogle Scholar
  15. Kim, M. H., Kumar, B., & Chae, J. W. (2006). Performance evaluation of loading/offloading from floating quay to super container ship. in Proceedings of the sixteenth international offshore and polar engineering conference. Google Scholar
  16. Kim, J., & Morrison, J. R. (2011). Offshore port service concepts: Classification and economic feasibility. Flexible Services and Manufacturing Journal (in press).Google Scholar
  17. Kumar, B. (2005). Dynamic analysis of floating quay and container ship for container loading and offloading operation. Master’s Thesis, Texas A &M University.Google Scholar
  18. Lim, A. (1998). The berth planning problem. Operations Research Letters, 22, 105–110.CrossRefGoogle Scholar
  19. Morrison, J. R., & Lee, T. (2009). Decoupling (un)loading operations from the land–sea interface in port service: The mobile floating port concept. Proceedings of the 5th international conference on axiomatic design, Lisbon (pp. 57–63).Google Scholar
  20. Nam, H., & Lee, T. (2012). A scheduling problem for a novel container transport system: A case of mobile harbor operation schedule. Flexible Services and Manufacturing Journal (in press).Google Scholar
  21. Stahlbock, R., & Voß, S. (2008). Operations research at container terminals: A literature update. OR Spectrum, 30, 1–52.CrossRefGoogle Scholar
  22. Steenken, D., Voß, S., & Stahlbock, R. (2004). Container terminal operation and operations research—A classification and literature review. OR Spectrum, 26, 3–49.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Lehrstuhl für Operations ManagementFriedrich-Schiller-Universität JenaJenaGermany
  2. 2.Lehrstuhl für Quantitative PlanungUniversität SiegenSiegenGermany

Personalised recommendations