IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v243y2016i1d10.1007_s10479-014-1645-z.html
   My bibliography  Save this article

On double cycling for container port productivity improvement

Author

Listed:
  • Dusan Ku

    (University of Auckland)

  • Tiru S. Arthanari

    (University of Auckland)

Abstract

How quay cranes (QC) are scheduled is vital to the productivity of seaside container port operations. Double cycling concept is an operation strategy of loading the containers into ships as they are unloaded, thus improving the efficiency of a QC as well as the container port. Goodchild and Daganzo (Transp Sci 40(4):473–483, 2006) first described QC double cycling problem and solved the problem after formulating it into a two machine flow shop problem. Song (Port Technol Int 36:50–52, 2007) studied the formula to determine the optimal starting sequence for double cycling while reflecting on the practical issue of QC working direction. The above studies focused on a single QC double cycling and their empirical trials showed the double cycling could improve the productivity of each QC approximately by between 10 and 20 %. In Zhang and Kim (Comput Ind Eng 56(3):979–992, 2009), a multiple QC double cycling model was first suggested by formulating a mixed integer programming model to maximise the number of double cycles between multiple QCs. In the present paper we point out a flaw with the existing multiple QC double cycling model that lets cycles that are not implementable. In addition, the paper discusses the need for imposing constraints arising from real world requirements to the formulations aiming at double cycling.

Suggested Citation

  • Dusan Ku & Tiru S. Arthanari, 2016. "On double cycling for container port productivity improvement," Annals of Operations Research, Springer, vol. 243(1), pages 55-70, August.
    • Handle: RePEc:spr:annopr:v:243:y:2016:i:1:d:10.1007_s10479-014-1645-z
    DOI: 10.1007/s10479-014-1645-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1645-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1645-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Anne V. Goodchild & Carlos F. Daganzo, 2006. "Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations," Transportation Science, INFORMS, vol. 40(4), pages 473-483, November.
    2. Goodchild, A. V. & Daganzo, C. F., 2004. "Reducing Ship Turn-Around Time Using Double-Cycling," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt86r4p6sc, Institute of Transportation Studies, UC Berkeley.
    3. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    4. Goodchild, Anne Victoria, 2005. "Crane Double Cycling in Container Ports: Algorithms, Evaluation, and Planning," University of California Transportation Center, Working Papers qt0nt8t1db, University of California Transportation Center.
    5. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    6. Goodchild, Anne V. & Daganzo, Carlos F., 2005. "Crane Double Cycling in Container Ports: Affect on Ship Dwell Time," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qp7p7jq, Institute of Transportation Studies, UC Berkeley.
    7. Mordecai Avriel & Michal Penn & Naomi Shpirer & Smadar Witteboon, 1998. "Stowage planning for container ships to reduce the number of shifts," Annals of Operations Research, Springer, vol. 76(0), pages 55-71, January.
    8. Kim, Kap Hwan & Park, Young-Man, 2004. "A crane scheduling method for port container terminals," European Journal of Operational Research, Elsevier, vol. 156(3), pages 752-768, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jia, Beizhen & Tierney, Kevin & Reinhardt, Line Blander & Pahl, Julia, 2022. "Optimal dual cycling operations in roll-on roll-off terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Ming & Chu, Feng & Zhang, Zizhen & Chu, Chengbin, 2015. "A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 52-74.
    2. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    3. Evrim Ursavas, 2017. "Crane allocation with stability considerations," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(2), pages 379-401, June.
    4. Feifeng Zheng & Yaxin Pang & Ming Liu & Yinfeng Xu, 2020. "Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 708-724, April.
    5. Guvenc Dik & Erhan Kozan, 2017. "A flexible crane scheduling methodology for container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 29(1), pages 64-96, March.
    6. Chung-Yee Lee & Ming Liu & Chengbin Chu, 2015. "Optimal Algorithm for the General Quay Crane Double-Cycling Problem," Transportation Science, INFORMS, vol. 49(4), pages 957-967, November.
    7. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    8. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    9. Zhang, An & Zhang, Wenshuai & Chen, Yong & Chen, Guangting & Chen, Xufeng, 2017. "Approximate the scheduling of quay cranes with non-crossing constraints," European Journal of Operational Research, Elsevier, vol. 258(3), pages 820-828.
    10. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    11. Chen, Jiang Hang & Lee, Der-Horng & Cao, Jin Xin, 2011. "Heuristics for quay crane scheduling at indented berth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1005-1020.
    12. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    13. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    14. Hongming Li & Xintao Li, 2022. "A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy," Mathematics, MDPI, vol. 10(24), pages 1-20, December.
    15. Agra, Agostinho & Oliveira, Maryse, 2018. "MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 138-148.
    16. Chen, Lu & Langevin, André & Lu, Zhiqiang, 2013. "Integrated scheduling of crane handling and truck transportation in a maritime container terminal," European Journal of Operational Research, Elsevier, vol. 225(1), pages 142-152.
    17. Jayanth Krishna Mogali & Joris Kinable & Stephen F. Smith & Zachary B. Rubinstein, 2021. "Scheduling for multi-robot routing with blocking and enabling constraints," Journal of Scheduling, Springer, vol. 24(3), pages 291-318, June.
    18. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.
    19. Canrong Zhang & Tao Wu & Mingyao Qi & Lixin Miao, 2018. "Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-28, June.
    20. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:243:y:2016:i:1:d:10.1007_s10479-014-1645-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.