Skip to main content
Springer Nature Link
Log in

Scheduling small number of quay cranes with non-interference constraint

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Quay crane (QC) scheduling significantly affects the turn-around time of a container vessel, and it plays an important role in container terminal operation. Lee et al. (An approximation algorithm for quay crane scheduling with non-interference constraints in port container terminals, Presented at Tristan VI, Phuket, June 10–15, 2007) present a 2-approximation algorithm for QC scheduling problem with non-interference constraint. In this paper we revisit Lee’s heuristic for the scenario with small number of QCs, and prove that it is 4/3 and 5/3-approximation for the case with two QCs and the case with three QCs respectively.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Ambrosino, D., Sciomachen, A.: Impact of yard organization on the master bay planning problem. Mariti. Econ. Logist. 5, 285–300 (2003)

    Article  Google Scholar 

  2. Avriel, M., Penn, M.: Exact and approximate solutions of the container ship stowage problem. Comput. Ind. Eng. 25, 271–274 (1993)

    Article  Google Scholar 

  3. Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Op. Res. 202, 615–627 (2010)

    Article  MATH  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  5. Goodchild, A.V., Daganzo, C.F.: Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp. Sci. 40, 473–483 (2006)

    Article  Google Scholar 

  6. Imai, A., Sasaki, K., Nishimura, E., Papadimitriou, S.: Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. Eur. J. Oper. Res. 171, 373–389 (2006)

    Article  MATH  Google Scholar 

  7. Kang, J.G., Kim, Y.D.: Stowage planning in maritime container transportation. J. Oper. Res. Soc. 53, 415–426 (2002)

    Article  MATH  Google Scholar 

  8. Lee, D.H., Chen, J.H.: An improved approach for quay crane scheduling with non-crossing constraints. Eng. Optim. 42, 1–15 (2010)

    Article  Google Scholar 

  9. Lee D.H., Wang H.Q., Miao L.: An approximation algorithm for quay crane scheduling with non-interference constraints in port container terminals, Presented at Tristan VI, Phuket, June 10–15 (2007)

  10. Lee, D.H., Wang, H.Q., Miao, L.: Quay crane scheduling with non-interference constraints in port container terminals. Transp. Res. Part E 44, 124–135 (2008)

    Article  Google Scholar 

  11. Lim A., Rodrigues B., Xu Z.: Approximation Schemes for the Crane Scheduling Problem, Hagerup, T., Katajainen, J. (Eds.): SWAT2004, LNCS 3111, pp. 323–335 (2004)

  12. Lim, A., Rodrigues, B., Xu, Z.: A m-parallel crane scheduling problem with a non-crossing constraint. Nav. Res. Logist. 54, 115–127 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Meisel, F., Wichmann, M.: Container sequencing for quay cranes with internal reshuffles. OR Spectr. 32, 569–591 (2010)

    Article  MATH  Google Scholar 

  14. Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectr. 30, 1–52 (2008)

    Article  MATH  Google Scholar 

  15. UNCTAD, Review of maritime transport 2012, United Nations, New York and Geneva (2012)

  16. Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng. 56, 979–992 (2009)

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank Prof. Chung-Yee Lee and anonymous referees for their insightful comments. The work is supported by the National Natural Science Foundation of China (Grant No. 71101106, 71172189, 71090404/71090400), Program for New Century Excellent Talents in University (No. NCET-12-0824), DHU Distinguished Young Professor Program (No. A201305) and the Fundamental Research Funds for the Central Universities (No. 2232013D3-46).

Author information

Authors and Affiliations

  1. School of Economics and Management, Tongji University, Shanghai, 200092, People’s Republic of China

    Ming Liu

  2. Glorious Sun School of Business and Management, Donghua University, Shanghai, 200051, People’s Republic of China

    Feifeng Zheng

  3. Supply Chain Management and Logistics Research, IBM Research-China, Diamond building 19-A, Donbeiwang West Road No.8, Beijing, 100193, People’s Republic of China

    Jinfeng Li

Authors
  1. Ming Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Feifeng Zheng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jinfeng Li
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Feifeng Zheng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, M., Zheng, F. & Li, J. Scheduling small number of quay cranes with non-interference constraint. Optim Lett 9, 403–412 (2015). https://doi.org/10.1007/s11590-014-0756-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0756-4

Keywords