Browse > Article
http://dx.doi.org/10.7236/JIIBC.2021.21.2.169

Stock Efficiency Algorithm for Lot Sizing Problem  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.21, no.2, 2021 , pp. 169-175 More about this Journal
Abstract
The lot sizing problem(LSP) is a hard problem that classified as non-deterministic(NP)-complete because of the polynomial-time optimal solution algorithm is unknown yet. The well-known W-W algorithm can be obtain the solution within polynomial-time, but this algorithm is a very complex, therefore the heuristic approximated S-M algorithm is suggested. This paper suggests O(n) linear-time complexity algorithm that can be find not the approximated but optimal solution. This algorithm determines the lot size Xt∗ in period t to the sum of the demands of interval [t,t+k], the period t+k is determined by the holding cost will not exceed setup cost of t+k period. As a result of various experimental data, this algorithm finds the optimal solution about whole data.
Keywords
Lot size; Holding cost; Setup cost; Stock efficiency; Economic production;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. J. Sadjadi, M. B. G. Aryanczhad, and H. A. Sadeghi, "An Improved Wagner-Whitin Algorithm", International Journal of Industrial Engineering & Production Research, Vol. 20, No. 3, pp. 117-123, Dec. 2009.
2 A. Wagelmans and S. V. Hoesel, "Economic Lot Sizing: An O(n log n) Algorithm that Runs in Linear Time in the Wagner-Whitin Case", Oprtations Research, Vol. 40, No. 1, pp. S145-S156, Feb. 1992, https://doi.org/10.1287/opre.40.1.S145   DOI
3 L. K. Gaafar and M. H. Choueiki, "A Neural Network Model for Solving the Lot-Sizing Problem", Omega, Vol. 28, No. 2, pp. 175-184, Apr. 2000, https://doi.org/10.1016/S0305-0483(99)00035-3   DOI
4 J. C. Lang and W. Domschke, "Efficient Reformulations for Dynamic Lot-Sizing Problems with Product Substitution", OR Spectrum, Vol. 32, No. 2, pp. 263-291, Apr. 2010, https://doi.org/10.1007/s00291-008-0148-1   DOI
5 N. Brahimi, N. Absi, S. Dauzere-Peres, N. M. Najid, and A. Nordli, "Single-Item Lot-Sizing Problems", European Journal of Operational Research, Vol. 168, No. 1, pp. 1-16, Jan. 2006, https://doi.org/10.1016/j.ejor.2004.01.054   DOI
6 C. H. Glock, E. H. Grosse, and J. M. Ries, "The Lot Sizing Problem: A Tertiary Study", International Journal of Production Economics, Vol. 155, pp. 39-51, Sep. 2014, https://doi.org/10.1016/j.ijpe.2013.12.009   DOI
7 N. Brahimi, N. Absi, S. Dauzere-Peres, and A. Nordli, "Single-Item Dynamic Lot-Sizing Problems: An Updated Survey", European Journal of Operational Research, Vol. 263, No. 3, pp. 838-863, Dec. 2017, https://doi.org/10.1016/j.ejor.2017.05.008   DOI
8 A. Akbalik and C. Rapine, "The Single Item Uncapacitated Lot-Sizing Problem with Time-Dependent Batch Sizes: NP-hard and Polynomial Cases", European Journal of Operational Research, Vol. 229, No. 2, pp. 353-363, Sep. 2013, https://doi.org/10.1016/j.ejor.2013.02.052   DOI
9 B. Karimi, S. M. T. F. Gihomi, and J. M. Wilson, "The Capacitated Lot Sizing Problem: A Review of Models and Algorithms", Omega, Vol. 31, No. 5, pp. 365-378, Oct. 2003, https://doi.org/10.1016/s0305-0483(03)00059-8   DOI
10 R. Jans and Z. Degraeve, "Modeling Industrial Lot Sizing Problems: A Review", International Journal of Production Research, Vol. 46, No. 6, pp. 1619-1643, Nov. 2007, https://doi.org/10.1080/00207540600902262   DOI
11 H. M. Wagner and T. M. Whitin, "Dynamic Version of the Economic Lot Size Model", Management Science, Vol. 5, No. 1, pp. 89-96, Oct. 1958, https://doi.org/10.1287/mnsc.5.1.89   DOI
12 E. A. Silver and H. C. Meal, "A Heuristic for Selecting Lot Size Quantities for the Case of a Deterministic Time-Varying Demand Rate and Discrete Opportunities for Replenishment", Production and Inventory Management: Journal of the American Production and Inventory Control Society, Vol. 14, No. 1, pp. 64-74, Feb. 1973.