A heuristic procedure for a single-item dynamic lot sizing problem

1988-1
Benli., Ömer S
Sabuncuoğlu, İhsan
Tüfekçi, Süleyman
An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning inventory must be equal to zero. The proposed algorithm is very easy to implement and compares very favourably with the existing heuristic procedures.

Citation Formats
Ö. S. Benli., İ. Sabuncuoğlu, and S. Tüfekçi, “A heuristic procedure for a single-item dynamic lot sizing problem,” Computers & Industrial Engineering, vol. 14, no. 2, pp. 181–192, 1988, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52018.