IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v40y2023i05ns0217595923400213.html
   My bibliography  Save this article

Scheduling double-track gantry cranes to minimize the overall loading/ unloading time

Author

Listed:
  • Jie Wang

    (School of Electronics and Information Engineering, Taizhou University, Linhai 317000, P. R. China)

  • Guangting Chen

    (Zhejiang University of Water Resources and Electric Power, Zhejiang, Hangzhou 310018, P. R. China)

  • Xinle Xuan

    (Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • An Zhang

    (Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • Yong Chen

    (Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • Yuehuan Wang

    (School of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou 310018, P. R. China)

  • Hecheng Zhang

    (Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

Abstract

In this paper, we consider the gantry crane scheduling problem at a single storage block where a total of m gantry cranes are mounted on double tracks so that cranes on different tracks can pass each other while those on the same track cannot. Containers at the storage block are divided into bays and each bay of containers has to be loaded/unloaded together due to the same shipping destination or the same customer. To minimize the overall loading/ unloading time of containers, we first formulate the problem to a mixed integer linear programming (MILP) model, and compute the optimal solutions of small instances by the Gurobi solver. Then we design several heuristic algorithms and test their efficiency and performance by a series of large instances. In particular, we present a polynomial time approximation algorithm for the case where all but one gantry crane is mounted on the same track. We show that the algorithm has a worst case ratio of 2 − 2 m, outperforming the partition-based algorithms in the single-track scenario.

Suggested Citation

  • Jie Wang & Guangting Chen & Xinle Xuan & An Zhang & Yong Chen & Yuehuan Wang & Hecheng Zhang, 2023. "Scheduling double-track gantry cranes to minimize the overall loading/ unloading time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(05), pages 1-26, October.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:05:n:s0217595923400213
    DOI: 10.1142/S0217595923400213
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923400213
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923400213?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:wsi:apjorx:v:40:y:2023:i:05:n:s0217595923400213. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.