A heuristic procedure for a single-item dynamic lot sizing problem
Benli, O. S.
Computers and Industrial Engineering
181 - 192
Item Usage Stats
MetadataShow full item record
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. © 1988.