IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i4p597-d749666.html
   My bibliography  Save this article

Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield

Author

Listed:
  • Jing Wu

    (Frontiers Science Center for Industrial Intelligence and Systems Optimization, Northeastern University, Shenyang 110819, China)

  • Dan Zhang

    (Leeds School of Business, University of Colorado Boulder, Boulder, CO 80309, USA)

  • Yang Yang

    (Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University), Ministry of Education, Shenyang 110819, China)

  • Gongshu Wang

    (Liaoning Engineering Laboratory of Data Analytics and Optimization for Smart Industry, Shenyang 110819, China)

  • Lijie Su

    (Liaoning Key Laboratory of Manufacturing System and Logistics Optimization, Shenyang 110819, China)

Abstract

This paper studies a multi-stage multi-product production and inventory planning problem with random yield derived from the cold rolling process in the steel industry. The cold rolling process has multiple stages, and intermediate inventory buffers are kept between stages to ensure continuous operation. Switching products during the cold rolling process is typically very costly. Backorder costs are incurred for unsatisfied demand while inventory holding costs are incurred for excess inventory. The process also experiences random yield. The objective of the production and inventory planning problem is to minimize the total cost including the switching costs, inventory holding costs, and backorder costs. We propose a stochastic formulation with a nonlinear objective function. Two lower bounds are proposed, which are based on full information relaxation and Jensen’s inequality, respectively. Then, we develop two heuristics from the proposed lower bounds. In addition, we propose a two-stage procedure motivated by newsvendor logic. To verify the performance of the proposed bounds and heuristics, computational tests are conducted on synthetic instances. The results show the efficiency of the proposed bounds and heuristics.

Suggested Citation

  • Jing Wu & Dan Zhang & Yang Yang & Gongshu Wang & Lijie Su, 2022. "Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield," Mathematics, MDPI, vol. 10(4), pages 1-21, February.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:4:p:597-:d:749666
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/4/597/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/4/597/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fleischmann, Bernhard, 1994. "The discrete lot-sizing and scheduling problem with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 75(2), pages 395-404, June.
    2. Xiaowu Chen & Guozhang Jiang & Yongmao Xiao & Gongfa Li & Feng Xiang, 2021. "A Hyper Heuristic Algorithm Based Genetic Programming for Steel Production Scheduling of Cyber-Physical System-ORIENTED," Mathematics, MDPI, vol. 9(18), pages 1-25, September.
    3. Gabriel R. Bitran & Thin-Yin Leong, 1992. "Deterministic Approximations to Co-Production Problems with Service Constraints and Random Yields," Management Science, INFORMS, vol. 38(5), pages 724-742, May.
    4. Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
    5. Tang, Lixin & Wang, Gongshu, 2008. "Decision support system for the batching problems of steelmaking and continuous-casting production," Omega, Elsevier, vol. 36(6), pages 976-991, December.
    6. Salomon, Marc & Solomon, Marius M. & Van Wassenhove, Luk N. & Dumas, Yvan & Dauzere-Peres, Stephane, 1997. "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 100(3), pages 494-513, August.
    7. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    8. Stanley B. Gershwin, 1987. "An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking," Operations Research, INFORMS, vol. 35(2), pages 291-305, April.
    9. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    10. 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.
    11. Berling, Peter, 2008. "Holding cost determination: An activity-based cost approach," International Journal of Production Economics, Elsevier, vol. 112(2), pages 829-840, April.
    12. Gelders, Ludo F. & Van Wassenhove, Luk N., 1981. "Production planning: a review," European Journal of Operational Research, Elsevier, vol. 7(2), pages 101-110, June.
    13. Diaby, M. & Bahl, H. C. & Karwan, M. H. & Zionts, S., 1992. "Capacitated lot-sizing and scheduling by Lagrangean relaxation," European Journal of Operational Research, Elsevier, vol. 59(3), pages 444-458, June.
    14. Zijm, W. H. M., 1992. "Hierarchical production planning and multi-echelon inventory management," International Journal of Production Economics, Elsevier, vol. 26(1-3), pages 257-264, February.
    15. Candace Arai Yano & Hau L. Lee, 1995. "Lot Sizing with Random Yields: A Review," Operations Research, INFORMS, vol. 43(2), pages 311-334, April.
    16. L. Escudero & P. Kamesam, 1995. "On solving stochastic production planning problems via scenario modelling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 3(1), pages 69-95, June.
    17. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    18. Suleyman Karabuk & S. David Wu, 2003. "Coordinating Strategic Capacity Planning in the Semiconductor Industry," Operations Research, INFORMS, vol. 51(6), pages 839-849, December.
    19. Lixin Tang & Ying Meng & Zhi-Long Chen & Jiyin Liu, 2016. "Coil Batching to Improve Productivity and Energy Utilization in Steel Production," Manufacturing & Service Operations Management, INFORMS, vol. 18(2), pages 262-279, May.
    20. Evan L. Porteus, 1986. "Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction," Operations Research, INFORMS, vol. 34(1), pages 137-144, February.
    21. Talay, Işılay & Özdemir-Akyıldırım, Öznur, 2019. "Optimal procurement and production planning for multi-product multi-stage production under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 275(2), pages 536-551.
    22. Srinivas Bollapragada & Thomas E. Morton, 1999. "Myopic Heuristics for the Random Yield Problem," Operations Research, INFORMS, vol. 47(5), pages 713-722, October.
    23. Harvey M. Wagner, 1980. "Feature Article—Research Portfolio for Inventory Management and Production Planning Systems," Operations Research, INFORMS, vol. 28(3-part-i), pages 445-475, June.
    24. G. R. Bitran & S. Dasu, 1992. "Ordering Policies in an environment of Stochastic Yields and Substitutable Demands," Operations Research, INFORMS, vol. 40(5), pages 999-1017, October.
    25. Kelle, Peter & Milne, Alistair, 1999. "The effect of (s, S) ordering policy on the supply chain," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 113-122, March.
    26. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    27. Mula, J. & Poler, R. & Garcia-Sabater, J.P. & Lario, F.C., 2006. "Models for production planning under uncertainty: A review," International Journal of Production Economics, Elsevier, vol. 103(1), pages 271-285, September.
    28. Dayong Han & Qiuhua Tang & Zikai Zhang & Zixiang Li, 2020. "An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants," Mathematics, MDPI, vol. 8(10), pages 1-28, September.
    29. Cong Cheng & Lixin Tang, 2018. "Robust policies for a multi-stage production/inventory problem with switching costs and uncertain demand," International Journal of Production Research, Taylor & Francis Journals, vol. 56(12), pages 4264-4282, June.
    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. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    3. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    6. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    7. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    8. Mula, J. & Poler, R. & Garcia-Sabater, J.P. & Lario, F.C., 2006. "Models for production planning under uncertainty: A review," International Journal of Production Economics, Elsevier, vol. 103(1), pages 271-285, September.
    9. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    10. Hu, Zhengyang & Hu, Guiping, 2016. "A two-stage stochastic programming model for lot-sizing and scheduling under uncertainty," International Journal of Production Economics, Elsevier, vol. 180(C), pages 198-207.
    11. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    12. Gel, Esma S. & Salman, F. Sibel, 2022. "Dynamic ordering decisions with approximate learning of supply yield uncertainty," International Journal of Production Economics, Elsevier, vol. 243(C).
    13. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    14. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    15. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    16. Armentano, Vinícius A. & França, Paulo M. & de Toledo, Franklina M. B., 1999. "A network flow model for the capacitated lot-sizing problem," Omega, Elsevier, vol. 27(2), pages 275-284, April.
    17. Haase, Knut & Kimms, Alf, 2000. "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, Elsevier, vol. 66(2), pages 159-169, June.
    18. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    20. Ying-Ju Chen & Brian Tomlin & Yimin Wang, 2013. "Coproduct Technologies: Product Line Design and Process Innovation," Management Science, INFORMS, vol. 59(12), pages 2772-2789, December.

    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:gam:jmathe:v:10:y:2022:i:4:p:597-:d:749666. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.