PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
1996-1997 | 24 | 1 | 57-75
Tytuł artykułu

Algorithm for turnpike policies in the dynamic lot size model

Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine an optimal infinite inverse policy and a strong turnpike policy relative to the class of standard or batch ordering type policies. Some remarks on the existence of planning and forecast horizons are also given.
Słowa kluczowe
Rocznik
Tom
24
Numer
1
Strony
57-75
Opis fizyczny
Daty
wydano
1996
otrzymano
1995-06-29
poprawiono
1995-10-12
poprawiono
1996-04-12
Twórcy
  • Institute of Computer Science, Polish Academy of Sciences, 21 Ordona Street, 01-237 Warszawa, Poland
Bibliografia
  • [1] R. L. Ackoff, E. L. Arnoff and C. Churchman, Introduction to Operations Research, Wiley, New York, 1957.
  • [2] A. Bensoussan, J. M. Proth and M. Queyranne, A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs, Naval Res. Logist. 38 (1991), 729-742.
  • [3] C. Bes and S. Sethi, Concepts of forecast and decision horizons: applications to dynamic stochastic optimization problems, Math. Oper. Res. 13 (1988), 295-310.
  • [4] S. Bylka, Horizon theorems for the solution of the dynamic lot-size model, in: Proc. Second Internat. Sympos. on Inventories, Budapest, Publ. House Hungar. Acad. Sci., 1982, 649-660.
  • [5] S. Bylka and S. Sethi, Existence and derivation of forecast horizons in a dynamic lot size models with nondecreasing holding costs, Production and Operations Management 1 (1992), 212-224.
  • [6] S. Chand, S. P. Sethi and J. M. Proth, Existence of forecast horizons in undiscounted discrete time lot-size model, Oper. Res. 38 (1990), 884-892.
  • [7] A. Federgruen and M. Tzur, The dynamic lot-sizing model with backlogging: A simple O(n log n) algorithm and minimal forecast horizon procedure, Naval Res. Logist. 40 (1993), 459-478.
  • [8] K. Hinderer and G. Hübner, An improvement of J. F. Shapiro's turnpike theorem for the horizon of finite stage discrete dynamic programs, in: Trans. Seventh Prague Conf. on Information Theory 1974, Vol. A, Acad. Publ. House, Praha, 1977, 245-255.
  • [9] C. Y. Lee and E. V. Denardo, Rolling planning horizons: error bounds for the dynamic lot-size model, Math. Oper. Res. 11 (1986), 423-432.
  • [10] J. Łoś, Horizons in dynamic programs, in: Proc. Fifth Berkeley Sympos. on Mathematical Statistics and Probability, California University Press, Berkeley, Calif., 1967, 479-490.
  • [11] V. Lotfi and Y.-S. Yoon, An algorithm for the single-item capacitated lot size model with concave production and holding costs, J. Oper. Res. Soc. 45 (1994), 934-941.
  • [12] R. Lundin and T. Morton, Planning horizon for the dynamic lot size model: Zabel vs. protective procedures and computational results, Oper. Res. 23 (1975), 711-735.
  • [13] S. M. Ryan, J. C. Bean and L. Smith, A tie-breaking rule for discrete infinite horizon optimization, ibid. 40 (1992), Suppl. 2, S117-S126.
  • [14] R. A. Sandbothe and G. L. Thompson, A forward algorithm for the capacitated lot size model with stockouts, ibid. 38 (1990), 474-486.
  • [15] H. M. Wagner and T. M. Whitin, Dynamic version of the economic lot size model, Manag. Sci. 5 (1959), 89-96.
  • [16] Y.-S. Zheng and F. Chen, Inventory policies with quantized ordering, Naval Res. Logist. 39 (1992), 285-305.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-zmv24i1p57bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.