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

Date

1988-1

Author

Benli., Ömer S
Sabuncuoğlu, İhsan
Tüfekçi, Süleyman

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

6
views

0
downloads

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.

Subject Keywords

General Engineering, General Computer Science, Computer Science, Interdisciplinary Applications; Engineering, Industrial

URI

https://hdl.handle.net/11511/52018

Journal

Computers & Industrial Engineering

DOI

https://doi.org/10.1016/0360-8352(88)90027-7

Collections

Department of Industrial Engineering, Article

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.