A Perfect Algorithm for the Capacitated Lot Size Model with Stockouts

  • Michael Bastian
  • Michael Volkmer


For the single-product capacitated dynamic lot size problem with stockouts, a procedure is proposed that detects the optimal first lot size at the earliest possible moment. The proposed algorithm uses the data structure of a dynamic tree, in which long run potential optimal policies are represented by paths and each production decision by a node. Starting with a horizon t = 1 the procedure successively increases t and eliminates in each iteration t all decisions that are not part of an optimal policy using data of the first t periods.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K.R. Baker; P. Dixon; M.J. Magazine; E.A. Silver (1978), An algorithm for the dynamic lot-size problem with time-varying production capacity constraints, Management Science, vol 24., pp. 1710–1720.CrossRefGoogle Scholar
  2. [2]
    M. Bastian (1990), Lot-trees: a unifying view and efficient implementation of forward procedures for the dynamic lot-size problem, Computers Opns. Res., vol. 17, pp. 255–263.Google Scholar
  3. [3]
    M. Bastian (1992), A perfect lot—tree procedure for the discounted dynamic lot—size problem with speculation, Naval Research Logistics, vol. 39, pp. 651–668.Google Scholar
  4. [4]
    M. Bastian; M. Volkmer (1992), A perfect forward procedure for a single facility dynamic location/relocation problem, Operations Research Letters, vol. 12, pp. 11–16.Google Scholar
  5. [5]
    G. R. Bitran; H. Matsuo (1986), Approximation formulations for the single—product capacitated lot size problem, Operations Research, vol. 34, pp. 63–74.Google Scholar
  6. [6]
    G. R. Bitran; H. H. Yanasse (1982), Computational complexity of the capacitated lot size problem, Management Science, vol. 28, pp. 1174–1186.Google Scholar
  7. [7]
    S. Chand; T.E. Morton (1986), Minimal forecast horizon procedures for dynamic lot size models, Naval Research Logistics Quarterly, vol. 33, pp. 111–122.Google Scholar
  8. [8]
    G. D. Eppen; R. K. Martin (1987), Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations Research, vol. 35, pp. 832–848.Google Scholar
  9. [9]
    A. Federgruen; M. Tzur (1994), Minimal forecast horizons and a new planning procedure for the general dynamic lot size model: nervousness revisited, Operations Research, Vol. 42, pp. 456–468.CrossRefGoogle Scholar
  10. [10]
    B. Fleischmann (1990), The discrete lot—sizing and scheduling problem, EJOR, vol. 44, pp. 337–348.Google Scholar
  11. [11]
    R. Lundin; T.E. Morton (1975), Planning horizons for the dynamic lot size model: Zabel vs. protective procedures and computational results, Operations Research, vol. 23, pp. 711–734.Google Scholar
  12. [12]
    M. Salomon; L.G. Kroon, R. Kuik; L.N. van Wassenhove (1991), Some extensions of the discrete lotsizing and scheduling problem, Management Science, vol. 37, pp. 801–812.Google Scholar
  13. [13]
    R.A. Sandbothe; G.L. Thompson (1990), A forward algorithm for the capacitated lot size model with stockouts, Operations Research, vol. 38, pp. 474–486.Google Scholar
  14. [14]
    H.M. Wagner; T.M. Whitin (1958), Dynamic version of the economic lot size model, Management Science, vol. 5, pp. 89–96.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Michael Bastian
    • 1
  • Michael Volkmer
    • 1
  1. 1.Lehrstuhl für WirtschaftsinformatikRWTH AachenGermany

Personalised recommendations