IDEAS home Printed from https://ideas.repec.org/a/vrs/losutr/v9y2018i2p37-45n3.html
   My bibliography  Save this article

Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets

Author

Listed:
  • Marolt Jakob

    (University of Maribor/Faculty of Logistics, Celje, Slovenia)

  • Lerher Tone

    (University of Maribor/Faculty of Logistics, Celje, Slovenia)

Abstract

Our research objective is to lower intralogistics costs by minimizing the number of shuffling operations in a steel plant company commercial warehouse. The process of dispatching products consists of retrieving set of steel bar (SSB) from a floor stored stack or a special stacking frame by an overhead crane. To retrieve a targeted merchandise all SSB above targeted must be reshuffled. Proper assignment of storage locations is a key logistics problem for efficient order picking. We are comparing two heuristics, that do not require information of dispatching sequence of any stored products. We simulated the problem at hand with both methods. Our objective is to count the number of reshuffles using each heuristic on randomly generated examples and decide which is better in the long run. Our problem has similarities with storage assignment of steel plates or steel coils for minimization of reshuffling operations. The problem is also comparable to storage assignment of containers in a container yard. In our case we are dealing with a special stacking configuration of products, that demands different approach. We want to demonstrate which heuristic should be used in companies that lack necessary storage information infrastructure.

Suggested Citation

  • Marolt Jakob & Lerher Tone, 2018. "Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets," Logistics, Supply Chain, Sustainability and Global Challenges, Sciendo, vol. 9(2), pages 37-45, October.
    • Handle: RePEc:vrs:losutr:v:9:y:2018:i:2:p:37-45:n:3
    DOI: 10.2478/jlst-2018-0008
    as

    Download full text from publisher

    File URL: https://doi.org/10.2478/jlst-2018-0008
    Download Restriction: no
    File URL: https://libkey.io/10.2478/jlst-2018-0008?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
    ---><---

    References listed on IDEAS

    as
    1. Yat‐wah Wan & Jiyin Liu & Pei‐Chun Tsai, 2009. "The assignment of storage locations to containers for a container stack," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(8), pages 699-713, December.
    2. Lixin Tang & Ren Zhao & Jiyin Liu, 2012. "Models and algorithms for shuffling problems in steel plants," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 502-524, October.
    3. Zhang, Chuqian & Liu, Jiyin & Wan, Yat-wah & Murty, Katta G. & Linn, Richard J., 2003. "Storage space allocation in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 37(10), pages 883-903, December.
    4. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    Full references (including those not matched with items on IDEAS)

    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. M. Hakan Akyüz & Chung‐Yee Lee, 2014. "A mathematical formulation and efficient heuristics for the dynamic container relocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 101-118, March.
    2. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    3. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    4. Lixin Tang & Ren Zhao & Jiyin Liu, 2012. "Models and algorithms for shuffling problems in steel plants," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(7), pages 502-524, October.
    5. 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).
    6. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
    7. Maria A. M. Trindade & Paulo S. A. Sousa & Maria R. A. Moreira, 2021. "Defining a storage-assignment strategy for precedence-constrained order picking," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 146-160.
    8. Chen, Lu & Lu, Zhiqiang, 2012. "The storage location assignment problem for outbound containers in a maritime terminal," International Journal of Production Economics, Elsevier, vol. 135(1), pages 73-80.
    9. Roy, Debjit & Nigam, Shobhit & de Koster, René & Adan, Ivo & Resing, Jacques, 2019. "Robot-storage zone assignment strategies in mobile fulfillment systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 119-142.
    10. Kovács, András, 2011. "Optimizing the storage assignment in a warehouse served by milkrun logistics," International Journal of Production Economics, Elsevier, vol. 133(1), pages 312-318, September.
    11. Zhanwei Tian & Guoqing Zhang, 2021. "Multi-echelon fulfillment warehouse rent and production allocation for online direct selling," Annals of Operations Research, Springer, vol. 304(1), pages 427-451, September.
    12. Katta G. Murty & Yat-wah Wan & Jiyin Liu & Mitchell M. Tseng & Edmond Leung & Kam-Keung Lai & Herman W. C. Chiu, 2005. "Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System," Interfaces, INFORMS, vol. 35(1), pages 61-75, February.
    13. A. Scholz & G. Wäscher, 2017. "Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 491-520, June.
    14. Zhang, Di & Chen, Feng & Mei, Ziqiao, 2023. "Optimization on joint scheduling of yard allocation and transfer manpower assignment for automobile RO-RO terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    15. Jin, Jian Gang & Lee, Der-Horng & Hu, Hao, 2015. "Tactical berth and yard template design at container transshipment terminals: A column generation based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 168-184.
    16. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    17. Dobromir Herzog, 2021. "Human factor aspects in information security management in the traditional IT and cloud computing models," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 93-108.
    18. Nilendra Singh Pawar & Subir S. Rao & Gajendra K. Adil, 2024. "Improving Order-Picking Performance in E-Commerce Warehouses through Entropy-Based Hierarchical Scattering," Sustainability, MDPI, vol. 16(14), pages 1-27, July.
    19. Polten, Lukas & Emde, Simon, 2022. "Multi-shuttle crane scheduling in automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 892-908.
    20. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.

    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:vrs:losutr:v:9:y:2018:i:2:p:37-45:n:3. 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: Peter Golla (email available below). General contact details of provider: https://www.sciendo.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.