Skip to main content
  • 1015 Accesses

Abstract

The yard crane scheduling problem has been proved to be NP-hard (Bish et al. 2001). As discussed in the earlier chapters in this book, mathematical models can be developed to solve the problem. However, in practice, heuristics are often proposed to solve this optimization problem due to the size and of real-world problems (Sharif and Huynh 2012). This chapter attempts to discuss two underlying concepts for heuristics development for the problem of multiple yard crane scheduling: concurrent and divide and conquer . We then showcase one approach that is based on clustering and reassigning concepts, which applies the divide and conquer approach.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Bish, E.K., Chen, F., Leong, T., Li, C., Ng, J.W.C., Simchi-Levi, D. (2001) Analysis of a new scheduling and location problem. Naval Research Logistics. 46:363–385.

    Google Scholar 

  • Cao, Z., D. H. Lee, Q. Meng. (2008) Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals. International Journal of Production Economics. 115(1):221–228.

    Google Scholar 

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

    Google Scholar 

  • Li, W., Goh, M., Wu, Y., Petering, M. E. H., de Souza, R., and Wu, Y. C. (2012) A continuous time model for multiple yard crane scheduling with last minute job arrivals. International Journal of Production Economics. 136(2):332–343.

    Google Scholar 

  • Li, W., Wu, Y., Petering, M. E. H., Goh, M., and de Souza, R. (2009) Discrete time model and algorithms for container yard crane scheduling. European Journal of Operational Research. 198(1):165–172.

    Google Scholar 

  • Sharif, O., Huynh, N. (2012) Yard crane scheduling at container terminals: A comparative study of centralized and decentralized approaches. Maritime Economics & Logistics. 14(2):139–161.

    Google Scholar 

  • Tou, J. T., R. C. Gonzalez. (1974) Pattern Recognition Principles. Addison-Wesley, Reading.

    Google Scholar 

  • Wu, Y., Petering, M. E. H., Li, W.-K., Goh, M., and de Souza, R. (2006) A clustering-reassigning approach for multiple yard cranes scheduling at container terminals. In Pawar, K. S., Yu, M., Zhao, X., and Lalwani, C. S., editors, Proceedings of the 11th International Symposium on Logistics, pages 637–643, Beijing China.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenkai Li .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Li, W., Wu, Y., Goh, M. (2015). Heuristic Approach. In: Planning and Scheduling for Maritime Container Yards. Springer, Cham. https://doi.org/10.1007/978-3-319-17025-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17025-1_5

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics