Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9198))

Included in the following conference series:

  • 1310 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)

    MATH  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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

    Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. 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)

    Article  MATH  Google Scholar 

  10. Mandelbaum, M., Shabtay, D.: Scheduling unit length jobs on parallel machines with lookahead information. Journal of Scheduling 14(4), 335–350 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Park, Y.M., Kim, K.H.: A scheduling method for berth and quay cranes. OR Spectrum 25(1), 1–23 (2003)

    Article  MATH  Google Scholar 

  12. Zhang, L., Khammuang, K., Wirth, A.: On-line scheduling with non-crossing constraints. Operations Research Letters 36(5), 579–583 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. 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)

    Article  Google Scholar 

  14. 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)

    Article  MathSciNet  Google Scholar 

  15. Zheng, F., Qiao, L., Liu, M., Chu, C.: Online integrated allocation for small numbers of berths and quay cranes in container terminals (working paper)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, Xi’an Jiaotong University, Xi’an, 710049, China

    Jiayin Pan & Yinfeng Xu

  2. The State Key Lab for Manufacturing Systems Engineering, Xi’an, 710049, China

    Jiayin Pan & Yinfeng Xu

Authors
  1. Jiayin Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiayin Pan .

Editor information

Editors and Affiliations

  1. Beijing University of Technology, Beijing, China

    Dachuan Xu

  2. University of New Brunswick, Fredericton, Canada

    Donglei Du

  3. University of Texas at Dallas, Richardson, USA

    Dingzhu Du

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation