IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i1d10.1007_s10696-023-09490-1.html
   My bibliography  Save this article

A stack-based retrieval method for the steel plate yard retrieval problem in shipbuilding

Author

Listed:
  • Lebao Wu

    (Shanghai Jiao Tong University)

  • Zuhua Jiang

    (Shanghai Jiao Tong University)

  • Xinyu Li

    (Donghua University)

Abstract

The problem studied in this paper occurs in the steel plate yard in shipbuilding, where the stack number is approximately 40–50. The daily outbound job of the yard is to retrieve target plates distributed in different stacks. Relocation that moves the plate from one stack to another is required if target plates are blocked by blocking plates. The objective of the steel plate yard retrieval problem is to decide the retrieval order and relocation strategy, and thus, minimize the unproductive relocation number. In this paper, we introduce a stack-based retrieval method. This method is used to retrieve target plates according to a specific retrieval stack sequence, and blocking plates are preferentially relocated to stacks with no target plates. The relocation number and optimal condition of this method are analyzed. An integer programming model and heuristic algorithm are proposed to find the optimal parameters and to obtain the minimum relocation number for this method. The numerical experiments show that the proposed method can optimally solve most real-sized instances in a short amount of time.

Suggested Citation

  • Lebao Wu & Zuhua Jiang & Xinyu Li, 2024. "A stack-based retrieval method for the steel plate yard retrieval problem in shipbuilding," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 343-377, March.
    • Handle: RePEc:spr:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09490-1
    DOI: 10.1007/s10696-023-09490-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09490-1
    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/s10696-023-09490-1?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.

    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:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09490-1. 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: 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.