Advertisement

Annals of Operations Research

, Volume 43, Issue 6, pp 309–335 | Cite as

Production planning via scenario modelling

  • Laureano F. Escudero
  • Pasumarti V. Kamesam
  • Alan J. King
  • Roger J-B. Wets
Section VI Stochastic Programming

Abstract

Several Linear Programming (LP) and Mixed Integer Programming (MIP) models for the production and capacity planning problems with uncertainty in demand are proposed. In contrast to traditional mathematical programming approaches, we use scenarios to characterize the uncertainty in demand. Solutions are obtained for each scenario and then these individual scenario solutions are aggregated to yield a nonanticipative or implementable policy. Such an approach makes it possible to model nonstationarity in demand as well as a variety of recourse decision types. Two scenario-based models for formalizing implementable policies are presented. The first model is a LP model for multi-product, multi-period, single-level production planning to determine the production volume and product inventory for each period, such that the expected cost of holding inventory and lost demand is minimized. The second model is a MIP model for multi-product, multi-period, single-level production planning to help in sourcing decisions for raw materials supply. Although these formulations lead to very large scale mathematical programming problems, our computational experience with LP models for real-life instances is very encouraging.

Keywords

Mathematical Programming Product Inventory Mixed Integer Programming Linear Programming Model Capacity Planning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Alvarez, C.M. Cuevas, L.F. Escudero, J.L. de la Fuente, C. Garcia and F.J. Prieto, Linear networks with uncertainty. An application field for parallel computing in optimization,Netflow 93, Pisa, Italy (1993).Google Scholar
  2. [2]
    J.B. Birge, An L-shaped method computer code for multi-stage stochastic linear programs, in:Numerical Techniques for Stochastic Optimization, eds. Y. Ermoliev and R.J-B Wets (Springer, Berlin, 1987) pp. 255–266.Google Scholar
  3. [3]
    G.R. Bitran and H.H. Yanasse, Deterministic approximation to stochastic production problems, Oper. Res. 32(1984)999–1018.Google Scholar
  4. [4]
    G.B. Dantzig and P.W. Glynn, Parallel processors for planning under uncertainty, Ann. Oper. Res. 22(1990)1–21.Google Scholar
  5. [5]
    R.S. Dembo, Scenario immunization, Ann. Oper. Res. 30(1991)63–80.Google Scholar
  6. [6]
    R.S. Dembo and A.J. King, Tracking models and the optimal regret distribution in asset allocation, RC-17156, IBM T.J. Watson Research Center, Yorktown Heights, NY (1991).Google Scholar
  7. [7]
    B.P. Dzielinski and R.E. Gomory, Optimal programming of lot sizes, inventory and lot size allocations, Manag. Sci. 11(1965)874–890.Google Scholar
  8. [8]
    R. Entriken and G. Infanger, Decomposition and importance sampling for stochastic linear models, Research Report RC-15545, IBM T.J. Watson Research Center, Yorktown Heights, NY (1990).Google Scholar
  9. [9]
    Y. Ermoliev and R.J-B. Wets (eds.),Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1990).Google Scholar
  10. [10]
    L.F. Escudero, CMIT: a capacitated multi-level implosion tool for production planning, IBM T.J. Watson Research Center, Yorktown Heights, NY (1991).Google Scholar
  11. [11]
    L.F. Escudero and P.V. Kamesam, On solving stochastic production planning problems via scenario analysis, RC-17868, IBM T.J. Watson Research Center, Yorktown Heights, NY (1992).Google Scholar
  12. [12]
    G.D. Eppen, R.K. Martin and L. Schrage, A scenario approach to capacity planning, Oper. Res. 37(1989)517–527.Google Scholar
  13. [13]
    M. Florian and M. Klein, Deterministic production planning with concave costs and capacity constraints, Manag. Sci. 18(1971)12–20.Google Scholar
  14. [14]
    H.I. Grassmann, MSLiP: A computer code for the multistage stochastic linear programming problem, Math. Progr. 47(1990)407–423.Google Scholar
  15. [15]
    S.C. Graves, A tactical planning model for a job shop, Oper. Res. 34(1986)522–533.Google Scholar
  16. [16]
    S.C. Graves and C.H. Fine, A tactical planning model for manufacturing subcomponents of mainframe computers, J. Manufac. Oper. Manag. 2(1988)4–34.Google Scholar
  17. [17]
    IBM, OSL, Optimization Subroutine Library, Guide and Reference, SC23-0519 (1990).Google Scholar
  18. [18]
    G. Infanger, Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs, Technical Report SOl89-13, Systems Optimization Laboratory, Stanford University, CA (1989).Google Scholar
  19. [19]
    U.S. Karmakar, Capacity loading and release planning with work in progress and lead times, J. Manufac. Oper. Manag. 2(1989)105–123.Google Scholar
  20. [20]
    U.S. Karmakar, Lot sizes, lead times and in process inventories, Manag. Sci. 33(1987)409–423.Google Scholar
  21. [21]
    S. Kekre and S. Kekre, Work-in-process considerations in job shop capacity planning, Working Paper GSIA, Carnegie Mellon University (1985).Google Scholar
  22. [22]
    L.S. Lasdon and R.C. Terjung, An efficient algorithm for multi-echelon scheduling, Oper. Res. 19(1971)946–969.Google Scholar
  23. [23]
    I.J. Lustig, J.M. Mulvey and T.J. Carpenter, Formulating stochastic programs for interior point methods, Oper. Res. 39(1991)757–769.Google Scholar
  24. [24]
    F. Mobasheri, L.H. Orren and E.P. Sioshansi, Scenario planning at Southern California Edison, Interfaces 19(1989)31–44.Google Scholar
  25. [25]
    J.M. Mulvey, R.J. Vanderbei and S.A. Zenios, Robust optimization of large-scale systems: General modelling framework and computations, Report 91-06-04, The Wharton School, University of Pennsylvania, Philadelphia, PA (1991).Google Scholar
  26. [26]
    J.M. Mulvey and H. Vladimirou, Stochastic network optimization models for investment planning, Ann. Oper. Res. 20(1989)187–217.Google Scholar
  27. [27]
    S.S. Nielsen and S.A. Zenios, A massively parallel algorithm for nonlinear stochastic network problems, Report 90-09-08, The Wharton School, University of Pennsylvania, Philadelphia, PA (1990), to appear in Oper. Res.Google Scholar
  28. [28]
    R.T. Rockafellar and R.J-B Wets, Scenario and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119, 1987, Laxenburg, Austria. See also Math. Oper. Res. 16(1991)119–147.Google Scholar
  29. [29]
    A. Ruszczynski, Regularized decomposition and augmented Lagrangian decomposition for angular programming problems, in:Aspiration Based Decision Support Systems, ed. A. Levandowski and A.P. Wierzbicki (Springer, Berlin, 1989).Google Scholar
  30. [30]
    R. Van Slyke and R.J-B. Wets, L-shaped linear programs with application to optimal control and stochastic programming, SIAM J. Appl. Math. 17(1969)638–663.Google Scholar
  31. [31]
    R.J-B. Wets, The aggregation principle in scenario analysis and stochastic optimization, in:Algorithms and Model Formulations in Mathematical Programming, ed. S.W. Wallace (Springer, Berlin, 1989) pp. 92–113.Google Scholar
  32. [32]
    P.H. Zipkin, Models for design and control of stochastic multi-item batch production systems, Oper. Res. 34(1986)91–104.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • Laureano F. Escudero
    • 1
  • Pasumarti V. Kamesam
    • 2
  • Alan J. King
    • 2
  • Roger J-B. Wets
    • 2
  1. 1.UITESA and Mathematical Sciences SchoolCompultense University of MadridMadridSpain
  2. 2.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations