IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i13p4132-4147.html
   My bibliography  Save this article

A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks

Author

Listed:
  • Feifeng Zheng
  • Xiaoyi Man
  • Feng Chu
  • Ming Liu
  • Chengbin Chu

Abstract

Nowadays maritime transportation has become the mainstream of the global logistics, and the operational efficiency of container terminals plays a critical role in maritime transportation. As one of the most important terminal operational issues, yard crane scheduling that handles both storage and retrieval tasks has caught a lot of interest. However, the uncertainty on the release times of retrieval tasks, as one common phenomenon in daily operations, has been ignored in the literature. This paper investigates single yard crane scheduling to minimise the expected total tardiness of tasks, and focus on the case with uncertain release times of retrieval tasks. A two-stage stochastic programming model is proposed, and the sample average approximation (SAA) approach is applied to solve small instances of the problem. For large-scale instances, a genetic algorithm (GA) and a rule-based heuristic are developed. To evaluate the performances of the solution methods, numerical experiments with 300 instances are implemented. Computational results show that the rule-based heuristic outperforms both GA and SAA in terms of solution quality and running time.

Suggested Citation

  • Feifeng Zheng & Xiaoyi Man & Feng Chu & Ming Liu & Chengbin Chu, 2019. "A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks," International Journal of Production Research, Taylor & Francis Journals, vol. 57(13), pages 4132-4147, July.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:13:p:4132-4147
    DOI: 10.1080/00207543.2018.1516903
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1516903
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1516903?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.

    Citations

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


    Cited by:

    1. Li, Linman & Li, Yuqing & Liu, Ran & Zhou, Yaoming & Pan, Ershun, 2023. "A Two-stage Stochastic Programming for AGV scheduling with random tasks and battery swapping in automated container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    2. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    3. Wang, Zehao & Zeng, Qingcheng & Li, Xingchun & Qu, Chenrui, 2024. "A branch-and-price heuristic algorithm for the ART and external truck scheduling problem in an automated container terminal with a parallel layout," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    4. Li, Yiming & Sun, Zhuo & Hong, Soondo, 2024. "An exact algorithm for multiple-equipment integrated scheduling in an automated container terminal using a double-cycling strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:57:y:2019:i:13:p:4132-4147. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.