IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i10d10.1057_palgrave.jors.2601143.html
   My bibliography  Save this article

An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling

Author

Listed:
  • L Tang

    (Northeastern University)

  • J Liu

    (The Hong Kong University of Science and Technology)

  • A Rong

    (The Hong Kong University of Science and Technology)

  • Z Yang

    (Northeastern University)

Abstract

Steel production is a multi-stage process. A slab yard serves as a buffer between the continuous casting stage and the steel rolling stage. Steel slabs are stored in stacks in the yard. Shuffling is needed when picking up a slab for heating and rolling, if it is not in the top position of a stack. This paper studies the problem of selecting appropriate slabs in the yard for a given rolling schedule so as to minimise the total shuffling cost. The study uses the hot strip rolling mill in Shanghai Baoshan Iron and Steel Complex as an application background. We propose a new heuristic algorithm to solve the problem. This is a two-phase algorithm that first generates an initial feasible solution and then improves it using local search. The new algorithm is compared with the algorithm in use on randomly generated test problems and on real data. Experimental results show that the proposed algorithm yields significant better solutions. The average improvement over the old algorithm is 15%.

Suggested Citation

  • L Tang & J Liu & A Rong & Z Yang, 2001. "An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1091-1097, October.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:10:d:10.1057_palgrave.jors.2601143
    DOI: 10.1057/palgrave.jors.2601143
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601143
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601143?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. Singh, Kumar Ashutosh & Srinivas & Tiwari, M. K., 2004. "Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved Parallel Genetic Algorithms," International Journal of Production Economics, Elsevier, vol. 91(2), pages 135-147, September.
    2. Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.

    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:pal:jorsoc:v:52:y:2001:i:10:d:10.1057_palgrave.jors.2601143. 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.palgrave-journals.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.