IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v34y2004i3p215-225.html
   My bibliography  Save this article

The Slab-Design Problem in the Steel Industry

Author

Listed:
  • Milind Dawande

    (School of Management, University of Texas at Dallas, Richardson, Texas 75082)

  • Jayant Kalagnanam

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Ho Soo Lee

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Chandra Reddy

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Stuart Siegel

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

  • Mark Trumbo

    (IBM T. J. Watson Research Center, Yorktown Heights, New York 10598)

Abstract

Planners in the steel industry design a set of steel slabs to satisfy the order book subject to constraints on (1) achieving a total designed weight for each order using multiples of an order-specific production size range, (2) minimum and maximum sizes for each slab, and (3) feasible assignments of multiple orders to the same slab. We developed a heuristic solution based on matchings and bin packing that a large steel plant uses daily in mill operations.

Suggested Citation

  • Milind Dawande & Jayant Kalagnanam & Ho Soo Lee & Chandra Reddy & Stuart Siegel & Mark Trumbo, 2004. "The Slab-Design Problem in the Steel Industry," Interfaces, INFORMS, vol. 34(3), pages 215-225, June.
    • Handle: RePEc:inm:orinte:v:34:y:2004:i:3:p:215-225
    DOI: 10.1287/inte.1040.0077
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1040.0077
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1040.0077?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. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    2. F. J. Vasko & F. E. Wolf & K. L. Stott, 1987. "Optimal Selection of Ingot Sizes Via Set Covering," Operations Research, INFORMS, vol. 35(3), pages 346-353, June.
    3. Brian Denton & Diwakar Gupta & Keith Jawahir, 2003. "Managing Increasing Product Variety at Integrated Steel Mills," Interfaces, INFORMS, vol. 33(2), pages 41-53, April.
    4. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    5. Jayant R. Kalagnanam & Milind W. Dawande & Mark Trumbo & Ho Soo Lee, 2000. "The Surplus Inventory Matching Problem in the Process Industry," Operations Research, INFORMS, vol. 48(4), pages 505-516, August.
    6. Vasko, Francis J. & Newhart, Dennis D. & Stott, Kenneth Jr., 1999. "A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading," European Journal of Operational Research, Elsevier, vol. 114(1), pages 72-82, April.
    7. F J Vasko & J A McNamara & R N Parkes & F E Wolf & L R Woodyatt, 2000. "A matching approach for replenishing rectangular stock sizes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(3), pages 253-257, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bjorn P. Berg & Brian T. Denton, 2017. "Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 631-644, November.
    2. Mili Mehrotra & Milind Dawande & Srinagesh Gavirneni & Mehmet Demirci & Sridhar Tayur, 2011. "OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 267-282, April.
    3. Morikawa, Katsumi & Takahashi, Katsuhiko & Hirotani, Daisuke, 2014. "Make-to-stock policies for a multistage serial system under a make-to-order production environment," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 30-37.
    4. Wichmann, Matthias Gerhard & Spengler, Thomas Stefan, 2015. "Slab scheduling at parallel continuous casters," International Journal of Production Economics, Elsevier, vol. 170(PB), pages 551-562.
    5. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.

    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. Anantaram Balakrishnan & Joseph Geunes, 2003. "Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing," Operations Research, INFORMS, vol. 51(1), pages 94-112, February.
    2. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
    3. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    4. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    5. Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
    6. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.
    7. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    8. Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
    9. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    10. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    11. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    12. Ben Messaoud, Said & Chu, Chengbin & Espinouse, Marie-Laure, 2008. "Characterization and modelling of guillotine constraints," European Journal of Operational Research, Elsevier, vol. 191(1), pages 112-126, November.
    13. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    14. Alfieri, Arianna & van de Velde, Steef & Woeginger, Gerhard J., 2007. "Roll cutting in the curtain industry, or: A well-solvable allocation problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1397-1404, December.
    15. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    16. Hajizadeh, Iman & Lee, Chi-Guhn, 2007. "Alternative configurations for cutting machines in a tube cutting mill," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1385-1396, December.
    17. Arbib, Claudio & Marinelli, Fabrizio, 2005. "Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application," European Journal of Operational Research, Elsevier, vol. 163(3), pages 617-630, June.
    18. Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.
    19. Syam Menon & Linus Schrage, 2002. "Order Allocation for Stock Cutting in the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 324-332, April.
    20. Chengbin Chu & Julien Antonio, 1999. "Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems," Operations Research, INFORMS, vol. 47(4), pages 495-508, August.

    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:inm:orinte:v:34:y:2004:i:3:p:215-225. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.