
[1] Stuart E. Dreyfus and Averill M. Law. Art and Theory of Dynamic Programming. Academic Press, Inc. Orlando, FL, USA, 1977.
[2] E.A. Silver, D.F. Pyke, and R. Peterson. Inventory Management and Production Planning and Scheduling : Third Edition. Wiley, 1998.
[3] Harvey M. Wagner and Thomson M. Whitin. Dynamic version of the economic lot size model. Management Science, 5(1):89–96, 1958.
[4] Joseph D Blackburn and Robert A Millen. Heuristic lotsizing performance in a rollingschedule environment. Decision Sciences, 11(4):691–701, 1980.
[5] E.A. Silver and H.C. Meal. A simple modification of the eoq for the case of varying demand rate. Production and Inventory Management, 10:52–65, 1969.
[6] Gabriel R Bitran, Thomas L Magnanti, and Horacio H Yanasse. Approximation methods for the uncapacitated dynamic lot size problem. Management Science, 30(9):1121–1140, 1984.
[7] John J. DeMatteis. An economic lotsizing technique, i: The partperiod algorithm. IBM systems Journal, 7(1):30–38, 1968.
[8] S. Nahmias and T.L. Olsen. Production and Operations Analysis: Seventh Edition. Waveland Press, Inc., 2015.
[9] James R. Evans, Cem Saydam, and Mark McKnew. A note on solving the concave cost dynamic lotsizing problem in almost linear time. Journal of Operations Management, 8(2):159–167, 1989.
[10] Awi Federgruen and Michal Tzur. A simple forward algorithm to solve general dynamic lot sizing models with n periods in o(nlogn) or o(n) time. Management Science, 37(8):909– 925, 1991.
[11] Nusrat T. Chowdury, M.F. Baki, and A. Azab. Dynamic economic lotsizing problem: A new o(t) algorithm for the wagnerwhitin model. Computers & Industrial Engineering, 117:6–18, 2018.
[12] Kenneth R. Baker. An experimental study of the effectiveness of rolling schedules in production planning. Decision Sciences, 8:19–27, 1977.
57
[13] Tianbing Qian, Philip C. Jones, and Yinyu Ye. Worst case analysis of forward wagner whitin algorithm with rolling horizon. unpublished, 1996.
[14] Robert C. Carlson, Sara L. Beckman, and Dean H. Kropp. The effectiveness of extending the horizon in rolling production scheduling. Decision Sciences, 13:129–145, 1982.
[15] James R. Evans. An efficient implementation of the wagnerwhitin algorithm for dynamic lotsizing. Journal of Operation Management, 5(2):229–235, 1985.
[16] Kenneth R. Baker and David W. Peterson. An analytic framework for evaluating rolling schedules. Management Science, 25(4):341–351, 1979.
[17] Richard Bellman. Dynamic programming approach to optimal inventory processes with delay in delivery. Quarterly of Applied Mathematics, 18(4):399–403, 1961.
[18] Albert P.M. Wagelmans, A. van Hoesel, and Antoon Kolen. Economic lotsizing: An o(n log n) algorithm that runs in linear time in the wagnerwhitin case. Operations Research, 40(Supp. 1):145–156, 1992.
[19] Alok Aggarwal and James K. Park. Improved algorithms for economic lot size problems Operations Research, 41(3):549–571, 1993.
[20] M. Florian and M. Klein. Deterministic production planning with concave costs and capacity constraints. Management Science, 18(1):12–20, 1971.
[21] Kenneth R. Baker, P. Dixon, M.I. Magazine, and E.A. Silver. An algorithm for the dynamic lotsize problem with timevarying production capacity constraints. Management Science, 24(16):1710–1720, 1978.
[22] M. Florian, J.K. Lenstra, and A. Rinnooy Kan. Deterministic production planning: algorithms and complexity. Management Science, 26(7):669–679, 1980.
[23] A. Lambert and H. Luss. Production planning with timedependent capacity bounds. European Journal of Operational Research, 9:275–280, 1982.
[24] Gabriel R. Bitran and Horacio H. Yanasse. Computational complexity of the capacitated lot size problem. Management Science, 28:1–13, 1982.
[25] Chia Shin Chung and Chien Hua Mike Lin. An O(T 2) algorithm for the N I=G=N I=N D capacitated lot size problem. Management Science, 34:420–426, 1988.
[26] O. Kirca. An efficient algorithm for the capacitated single item dynamic lot size problem. European Journal of Operational Research, 45(1):15–24, 1990.
[27] HsinDer Chen, Donald W. Hearn, and Chung Yee Lee. A new dynamic programming algorithm for the single item capacitated dynamic lot size model. Journal of Global Optimization, 4:285–300, 1994.
[28] C. P. M. van Hoesel and Albert P.M. Wagelmans. An O(T 3) algorithm for the economic lotsizing problem with constant capacities. Management Science, 42:142–150, 1996.
58
[29] Dong X. Shaw and Albert P.M. Wagelmans. An algorithm for singleitem capacitated lot sizing with piecewise linear production costs and general holding costs. Management Science, 44:831–838, 1998.
[30] Wilco van den Heuvel and Albert P.M. Wagelmans. An efficient dynamic programming algorithm for a special case of the capacitated lotsizing problem. Computers & Operations Research, 33:3583–3599, 2006.
[31] Yi Feng, Shaoxiang Chen, Arun Kumar, and Bing Lin. Solving singleproduct economic lotsizing problem with nonincreasing setup cost, constant capacity and convex inventory in o(nlogn) time. Computers & Operations Research, 38:717–722, 2011.
[32] Jinwen Ou. Economic lotsizing with constant capacity and concave inventory costs. Naval Research Logistics, 59:717–722, 2012.
[33] H.M. Wagner. Principles of Operations Research with Applications to Managerial Decisions: 2nd ed. Englewood Cliffs, NJ: PrenticeHall, Inc., 1975.
[34] Kenneth R. Baker. An analysis of terminal conditions in rolling schedules. European Journal of Operational Research, 7:355–361, 1981.
[35] Eiji Mizutani and Stuart Dreyfus. Stagelookahead dynamic programming algorithms for stochastic problems with timelagged control dynamics. IEEE IEEM, 2009.
[36] S. Dreyfus. An analytic solution of the warehouse problem. Operations Research, 1:99– 104, 1957.
[37] R. Bellman. On the Theory of Dynamic Programming – a Warehouse Problem. Management Science, 2(3):272–274, 1956.
[38] R. Bellman. Dynamic programming approach to optimal inventory processes with delay in delivery Naval Research Logistics, XVIII(4):399–403, 1960.
[39] H. M. Wagner. A postscript to “Dynamic problems in the theory of the firm” Naval Research Logistics Quarterly, 7(1):7–12, 1960.
[40] Eiji Mizutani and Brigitte Trista. On two new dynamic programming procedures comparable to the WagnerWhitin regeneration point type in dynamic lot sizing. unpublished, 2019.
