IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v46y2014i3p267-282.html
   My bibliography  Save this article

Crane scheduling in a warehouse storing steel coils

Author

Listed:
  • Lixin Tang
  • Xie Xie
  • Jiyin Liu

Abstract

This article studies a single-crane scheduling problem in a warehouse where steel coils are stored in two levels. A given set of coils is to be retrieved from their designated places. If a required coil at the lower level is blocked by one or two coils at the upper level, to retrieve it, the blocking coils must be first moved to other positions. The considered problem is to determine the new positions and the required crane movements so that all coils are retrieved in the shortest possible time. A mixed-integer linear programming model is formulated for the problem and a sequential solution approach is implemented. A dynamic programming algorithm is proposed for optimally solving a restricted case. Based on the analysis of a special case, a heuristic algorithm is proposed for the general case and its worst-case performance is analyzed. The average performances of the solution approaches are computationally evaluated. The results show that the proposed heuristic algorithms are capable of generating good quality solutions.

Suggested Citation

  • Lixin Tang & Xie Xie & Jiyin Liu, 2014. "Crane scheduling in a warehouse storing steel coils," IISE Transactions, Taylor & Francis Journals, vol. 46(3), pages 267-282.
    • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:3:p:267-282
    DOI: 10.1080/0740817X.2013.802841
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.802841
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2013.802841?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. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    2. Emrah B. Edis & Ozlem Uzun Araz & Ozgur Eski & Rahime Sancar Edis, 2023. "Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 67-109, April.
    3. Yuan, Yuan & Tang, Lixin, 2017. "Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse," European Journal of Operational Research, Elsevier, vol. 262(2), pages 424-437.
    4. Lanza, Giacomo & Passacantando, Mauro & Scutellà, Maria Grazia, 2022. "Assigning and sequencing storage locations under a two level storage policy: Optimization model and matheuristic approaches," Omega, Elsevier, vol. 108(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:uiiexx:v:46:y:2014:i:3:p:267-282. 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/uiie .

    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.