Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
G. R. Bitran; H. Matsuo (1986), Approximation formulations for the single—product capacitated lot size problem, Operations Research, vol. 34, pp. 63–74.
G. R. Bitran; H. H. Yanasse (1982), Computational complexity of the capacitated lot size problem, Management Science, vol. 28, pp. 1174–1186.
S. Chand; T.E. Morton (1986), Minimal forecast horizon procedures for dynamic lot size models, Naval Research Logistics Quarterly, vol. 33, pp. 111–122.
G. D. Eppen; R. K. Martin (1987), Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations Research, vol. 35, pp. 832–848.
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.
B. Fleischmann (1990), The discrete lot—sizing and scheduling problem, EJOR, vol. 44, pp. 337–348.
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.
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.
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.
H.M. Wagner; T.M. Whitin (1958), Dynamic version of the economic lot size model, Management Science, vol. 5, pp. 89–96.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bastian, M., Volkmer, M. (1998). A Perfect Algorithm for the Capacitated Lot Size Model with Stockouts. In: Drexl, A., Kimms, A. (eds) Beyond Manufacturing Resource Planning (MRP II). Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03742-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-03742-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08393-8
Online ISBN: 978-3-662-03742-3
eBook Packages: Springer Book Archive