IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v369y2020ics0096300319308227.html
   My bibliography  Save this article

The multi-stage multi-product batch-sizing problem in the steel industry

Author

Listed:
  • Liu, Guoli
  • Li, Feng
  • Yang, Xianyan
  • Qiu, Shuang

Abstract

In this paper, we consider a batch-sizing problem with multiple periods and multiple types of products that arises in the steel industry. In this problem, products of a product type are produced in series of stages to fulfill the demand. Each stage consists of a work-in-process storage with inventory capacity and a production machine with a production rate. It incurs an inventory cost in the work-in-process storage of a stage, and also incurs a setup cost whenever a production batch is formed in the first stage. The problem is to determine the formation of each production batch in each period such that the total cost of setup and inventory is minimized. For the problem, we first provide a mixed-integer quadratic programming model and then propose some optimality properties. Based on the proposed properties, we design an optimal algorithm to solve the problem in polynomial time. Finally, we report the performances of the mixed-integer quadratic programming model and the optimal algorithm based on actual production data. The computational results confirm the reliability and validity of the optimal algorithm.

Suggested Citation

  • Liu, Guoli & Li, Feng & Yang, Xianyan & Qiu, Shuang, 2020. "The multi-stage multi-product batch-sizing problem in the steel industry," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    • Handle: RePEc:eee:apmaco:v:369:y:2020:i:c:s0096300319308227
    DOI: 10.1016/j.amc.2019.124830
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319308227
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124830?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.

    References listed on IDEAS

    as
    1. Peter McKenzie & Shekhar Jayanthi, 2007. "Ball Aerospace Explores Operational and Financial Trade-Offs in Batch Sizing in Implementing JIT," Interfaces, INFORMS, vol. 37(2), pages 108-119, April.
    2. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    3. Hwang, Juhwen & Wan, Yat-wah, 2013. "A supplier–retailer supply chain with intermediate storage for batch ordering," International Journal of Production Economics, Elsevier, vol. 142(2), pages 343-352.
    4. Bicheno, John & Holweg, Matthias & Niessmann, Jens, 2001. "Constraint batch sizing in a lean environment," International Journal of Production Economics, Elsevier, vol. 73(1), pages 41-49, August.
    5. Sarker, Bhaba R. & Jamal, A.M.M. & Mondal, Sanjay, 2008. "Optimal batch sizing in a multi-stage production system with rework consideration," European Journal of Operational Research, Elsevier, vol. 184(3), pages 915-929, February.
    6. Öncü Hazır & Safia Kedad-Sidhoum, 2014. "Batch sizing and just-in-time scheduling with common due date," Annals of Operations Research, Springer, vol. 213(1), pages 187-202, February.
    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áté Hegyháti & Krisztián Attila Bakon & Tibor Holczinger, 2023. "Optimization with uncertainties: a scheduling example," 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. 31(4), pages 1239-1263, December.
    2. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    3. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    4. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    5. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    6. Al-Salamah, Muhammad, 2019. "Economic production quantity in an imperfect manufacturing process with synchronous and asynchronous flexible rework rates," Operations Research Perspectives, Elsevier, vol. 6(C).
    7. Joseph B. Mazzola & William F. McCoy & Harvey M. Wagner, 1987. "Algorithms and heuristics for variable‐yield lot sizing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(1), pages 67-86, February.
    8. Pan, Zhendong & Tang, Jiafu & Liu, Ou, 2009. "Capacitated dynamic lot sizing problems in closed-loop supply chain," European Journal of Operational Research, Elsevier, vol. 198(3), pages 810-821, November.
    9. Ventura, José A. & Valdebenito, Victor A. & Golany, Boaz, 2013. "A dynamic inventory model with supplier selection in a serial supply chain structure," European Journal of Operational Research, Elsevier, vol. 230(2), pages 258-271.
    10. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    11. Chung‐Lun Li & Jinwen Ou & Vernon N. Hsu, 2012. "Dynamic lot sizing with all‐units discount and resales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 230-243, April.
    12. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    13. Mitali Sarkar & Li Pan & Bikash Koli Dey & Biswajit Sarkar, 2020. "Does the Autonomation Policy Really Help in a Smart Production System for Controlling Defective Production?," Mathematics, MDPI, vol. 8(7), pages 1-21, July.
    14. Akbalik, Ayse & Rapine, Christophe, 2013. "The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases," European Journal of Operational Research, Elsevier, vol. 229(2), pages 353-363.
    15. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    16. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    17. Okhrin, Irena & Richter, Knut, 2011. "The linear dynamic lot size problem with minimum order quantity," International Journal of Production Economics, Elsevier, vol. 133(2), pages 688-693, October.
    18. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    19. Okhrin, Irena & Richter, Knut, 2011. "An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 211(3), pages 507-514, June.
    20. Onur Ozturk, 2020. "A bi-criteria optimization model for medical device sterilization," Annals of Operations Research, Springer, vol. 293(2), pages 809-831, October.

    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:eee:apmaco:v:369:y:2020:i:c:s0096300319308227. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.