Skip to main content

A Cooperative Approach to Dispatching and Scheduling Twin-Yard Cranes in Container Terminals

  • Conference paper
  • First Online:
Book cover Computational Logistics (ICCL 2016)

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

Included in the following conference series:

  • 1799 Accesses

Abstract

To increase the productivity of the storage yard of a container terminal, two identical yard cranes are often deployed in a yard block. In theory, the productivity of a yard block may be doubled with twin-cranes. However, crane interference may severely lower the combined productivity of the twin-cranes. In this paper, we propose an online job dispatching method for twin yard cranes when side loading is used. The method adopts the non-zero-sum game approach to induce the cooperative behaviour in the dispatching and scheduling of jobs for the two cranes to minimize the total job completion time. A one-step lookahead algorithm and a two-step lookahead algorithm are proposed. We evaluate our algorithms against Ng’s lower bound of total completion time for twin-cranes and against the greedy heuristic Smallest Completion Time-First. Our experiments showed that our dispatching and scheduling algorithm performs very well.

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

Access this chapter

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 EPUB and 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

References

  • Cao, Z., Lee, D.H., Meng, Q.: Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals. Int. J. Prod. Econ. 115, 221–228 (2008)

    Article  Google Scholar 

  • Choe, R., Yuan, H., Yang, Y. Ryu, K.R.: Real-time scheduling of twin stacking cranes in an automated container terminal using a genetic algorithm. In: Symposium of Applied Computing, pp. 238–243 (2012)

    Google Scholar 

  • Dorndorf, U., Schneider, F.: Scheduling automated triple cross-over stacking cranes in a container yard. OR Spectr. 32(3), 617–632 (2010)

    Article  MATH  Google Scholar 

  • Gharehgozli, A.H., Laporte, G., Yu, Y., de Koster, R.: Scheduling twin yard cranes in a container block. Transp. Sci. 9(3), 706–719 (2015)

    Google Scholar 

  • Guo, X., Huang, S.Y., Hsu, W.J., Low, M.Y.H.: Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information. Adv. Eng. Inform. 25(3), 472–484 (2011)

    Article  Google Scholar 

  • Guo, X., Huang, S.Y.: Dynamic space and time partitioning for yard crane workload management in container terminals. Transp. Sci. 46(1), 134–148 (2012)

    Article  Google Scholar 

  • Huang, S.Y., Li, Y., Fan, F.: TwinCrane-ATCRSS-game: job dispatching with lookahead for twin yard cranes. In: The 5th International Conference on Logistics and Maritime Systems (2015)

    Google Scholar 

  • Jung, S.H., Kim, K.H.: Load scheduling for multiple quay cranes in port container terminals. J. Intell. Manuf. 17, 479–492 (2006)

    Article  Google Scholar 

  • Kumar, M.M., Omkar, S.N.: Optimization of yard crane scheduling using particle swarm optimization with genetic algorithm operators (PSOGAO). J. Sci. Ind. Res. 67, 335–339 (2008)

    Google Scholar 

  • Lee, D.H., Cao, Z., Meng, Q.: Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm. Int. J. Prod. Econ. 107, 115–124 (2007)

    Article  Google Scholar 

  • Li, W., Wu, Y., Petering, M., Goh, M., de Souza, R.: Discrete time model and algorithms for container yard crane scheduling. Eur. J. Oper. Res. 198, 165–172 (2009)

    Article  MATH  Google Scholar 

  • Ng, W.C.: Crane scheduling in container yards with intercrane interference. Eur. J. Oper. Res. 164, 64–78 (2005)

    Article  MATH  Google Scholar 

  • Ng, W.C., Mak, K.L.: An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Eng. Optim. 37(8), 867–877 (2005a)

    Article  MathSciNet  Google Scholar 

  • Ng, W.C., Mak, K.L.: Yard crane scheduling in port container terminals. Appl. Math. Model. 29(3), 263–276 (2005b)

    Article  MATH  Google Scholar 

  • Park, T., Choe, R., Ok, S.M., Ryu, K.R.: Real-time scheduling for twin RMGs in an automated container yard. OR Spectr. 32, 593–615 (2010)

    Article  MATH  Google Scholar 

  • Stahlbock, R., Voss, S.: Efficiency consideration for sequencing and scheduling of double-rail-mounted gantry cranes at maritime container terminals. Int. J. Shipping Transp. Logistics 2(1), 95–123 (2010)

    Article  Google Scholar 

  • Vis, I.F.A., Carlo, H.J.: Sequencing two cooperating automated stacking cranes in a container terminal. Transp. Sci. 44(2), 169–182 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shell Ying Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Huang, S.Y., Li, Y. (2016). A Cooperative Approach to Dispatching and Scheduling Twin-Yard Cranes in Container Terminals. In: Paias, A., Ruthmair, M., Voß, S. (eds) Computational Logistics. ICCL 2016. Lecture Notes in Computer Science(), vol 9855. Springer, Cham. https://doi.org/10.1007/978-3-319-44896-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44896-1_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44895-4

  • Online ISBN: 978-3-319-44896-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics