IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v260y2017i2p613-624.html
   My bibliography  Save this article

The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion

Author

Listed:
  • Chen, Jiang Hang
  • Bierlaire, Michel

Abstract

As a special case of the quay crane scheduling problem, the unidirectional quay crane scheduling problem has been received more and more attention. In this paper, we analyze the computational complexity of the unidirectional quay crane scheduling problem and propose a tighter mixed integer programming formulation. Next, we develop three makespan-constrained models to obtain risk-averse solutions to mitigate the impacts of ship instability and solution infeasibility (thus, need to revamp or even reschedule the plans). Comprehensive numerical experiments are designed to investigate the benefits of the tighter formulation and the three optimization models for risk-aversion.

Suggested Citation

  • Chen, Jiang Hang & Bierlaire, Michel, 2017. "The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion," European Journal of Operational Research, Elsevier, vol. 260(2), pages 613-624.
    • Handle: RePEc:eee:ejores:v:260:y:2017:i:2:p:613-624
    DOI: 10.1016/j.ejor.2017.01.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717300127
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.01.007?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. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. 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.
    3. 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.
    4. Chen, Jiang Hang & Lee, Der-Horng & Goh, Mark, 2014. "An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem," European Journal of Operational Research, Elsevier, vol. 232(1), pages 198-208.
    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. Defeng Sun & Lixin Tang & Roberto Baldacci & Zihan Chen, 2024. "A Decomposition Method for the Group-Based Quay Crane Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 543-570, March.
    2. Shoufeng Ma & Hongming Li & Ning Zhu & Chenyi Fu, 2021. "Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty," Journal of Scheduling, Springer, vol. 24(2), pages 137-174, April.
    3. 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.
    4. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    5. 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.
    6. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    7. Qin, Tianbao & Du, Yuquan & Chen, Jiang Hang & Sha, Mei, 2020. "Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel," European Journal of Operational Research, Elsevier, vol. 285(3), pages 884-901.
    8. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    9. Sun, Defeng & Tang, Lixin & Baldacci, Roberto & Lim, Andrew, 2021. "An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability," European Journal of Operational Research, Elsevier, vol. 291(1), pages 271-283.

    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. 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.
    2. Jiang Hang Chen, 2019. "A note on: a flexible crane scheduling methodology for container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 34-40, March.
    3. 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.
    4. Defeng Sun & Lixin Tang & Roberto Baldacci & Zihan Chen, 2024. "A Decomposition Method for the Group-Based Quay Crane Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 543-570, March.
    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. Shang, Xiao Ting & Cao, Jin Xin & Ren, Jie, 2016. "A robust optimization approach to the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 44-65.
    7. Noura Al-Dhaheri & Ali Diabat, 2017. "A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints," Annals of Operations Research, Springer, vol. 248(1), pages 1-24, January.
    8. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    9. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    10. Sun, Defeng & Tang, Lixin & Baldacci, Roberto & Lim, Andrew, 2021. "An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability," European Journal of Operational Research, Elsevier, vol. 291(1), pages 271-283.
    11. Qin, Tianbao & Du, Yuquan & Chen, Jiang Hang & Sha, Mei, 2020. "Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel," European Journal of Operational Research, Elsevier, vol. 285(3), pages 884-901.
    12. Shoufeng Ma & Hongming Li & Ning Zhu & Chenyi Fu, 2021. "Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty," Journal of Scheduling, Springer, vol. 24(2), pages 137-174, April.
    13. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    14. Rodrigues, Filipe & Agra, Agostinho, 2022. "Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey," European Journal of Operational Research, Elsevier, vol. 303(2), pages 501-524.
    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. Rodrigues, Filipe & Agra, Agostinho, 2021. "An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times," European Journal of Operational Research, Elsevier, vol. 295(2), pages 499-516.
    17. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    18. 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.
    19. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    20. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).

    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:eee:ejores:v:260:y:2017:i:2:p:613-624. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.