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

Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production

Author

Listed:
  • Jing Wu

    (School of Economics and Management, Shandong Huayu University of Technology, Dezhou 253034, China
    National Frontiers Science Center for Industrial Intelligence and Systems Optimization, Northeastern University, Shenyang 110819, China)

  • Lijie Su

    (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)

  • Yang Yang

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

Abstract

We study a multi-product production and inventory planning problem with uncertain demand in the cold rolling stage of steel production processes. The problem is to determine the production amount of each product in each planning period so that the sum of production, inventory holding, and backorder costs is minimized. We first formulate it into a Markov decision process (MDP) model, considering dynamic demand. Aiming at the proposed large-scale MDP model, we develop the improved Approximated Dynamic Programming (ADP) algorithms, which are composed of the reformulation and the approximation functions for the value function in MDP. Linear and two quadratic approximate functions are proposed to approximate the value function. Numerical experiments show the optimal gaps of the different approximation methods and illustrate the efficiency of the proposed ADP methods.

Suggested Citation

  • Jing Wu & Lijie Su & Gongshu Wang & Yang Yang, 2024. "Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production," Mathematics, MDPI, vol. 12(24), pages 1-17, December.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:24:p:3922-:d:1542766
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/24/3922/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/24/3922/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," The Review of Financial Studies, Society for Financial Studies, vol. 14(1), pages 113-147.
    2. 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.
    3. Eric V. Denardo, 1970. "On Linear Programming in a Markov Decision Problem," Management Science, INFORMS, vol. 16(5), pages 281-288, January.
    4. J. R. Morrison & P. R. Kumar, 1999. "New Linear Program Performance Bounds for Queueing Networks," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 575-597, March.
    5. 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.
    6. 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.
    7. 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.
    8. Thomas W. M. Vossen & Dan Zhang, 2015. "A Dynamic Disaggregation Approach to Approximate Linear Programs for Network Revenue Management," Production and Operations Management, Production and Operations Management Society, vol. 24(3), pages 469-487, March.
    9. Daniela Pucci de Farias & Benjamin Van Roy, 2004. "On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 462-478, August.
    10. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    11. Hugo P. Simão & Abraham George & Warren B. Powell & Ted Gifford & John Nienow & Jeff Day, 2010. "Approximate Dynamic Programming Captures Fleet Operations for Schneider National," Interfaces, INFORMS, vol. 40(5), pages 342-352, October.
    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. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    15. 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.
    16. Suleyman Karabuk & S. David Wu, 2003. "Coordinating Strategic Capacity Planning in the Semiconductor Industry," Operations Research, INFORMS, vol. 51(6), pages 839-849, December.
    17. Evan L. Porteus, 1986. "Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction," Operations Research, INFORMS, vol. 34(1), pages 137-144, February.
    18. Daniel Adelman, 2004. "A Price-Directed Approach to Stochastic Inventory/Routing," Operations Research, INFORMS, vol. 52(4), pages 499-514, August.
    19. 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.
    20. 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.
    21. 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.
    22. 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.
    23. 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.
    24. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," University of California at Los Angeles, Anderson Graduate School of Management qt43n1k4jb, Anderson Graduate School of Management, UCLA.
    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. 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.
    2. Selvaprabu Nadarajah & François Margot & Nicola Secomandi, 2015. "Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage," Management Science, INFORMS, vol. 61(12), pages 3054-3076, December.
    3. 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.
    4. 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.
    5. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    6. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    7. Qihang Lin & Selvaprabu Nadarajah & Negar Soheili, 2020. "Revisiting Approximate Linear Programming: Constraint-Violation Learning with Applications to Inventory Control and Energy Storage," Management Science, INFORMS, vol. 66(4), pages 1544-1562, April.
    8. 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.
    9. Fan You & Thomas Vossen, 2024. "An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching," INFORMS Journal on Computing, INFORMS, vol. 36(4), pages 1006-1022, July.
    10. Antoine Sauré & Jonathan Patrick & Martin L. Puterman, 2015. "Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 579-595, August.
    11. Laumer, Simon & Barz, Christiane, 2023. "Reductions of non-separable approximate linear programs for network revenue management," European Journal of Operational Research, Elsevier, vol. 309(1), pages 252-270.
    12. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    13. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    14. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    15. 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.
    16. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    17. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    18. 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.
    19. 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.
    20. 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.

    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:12:y:2024:i:24:p:3922-:d:1542766. 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.