A heuristic procedure for a single-item dynamic lot sizing problem
Date
1988
Authors
Benli, O. S.
Sabuncuoglu, I.
Tufekci, S.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Computers and Industrial Engineering
Print ISSN
0360-8352
Electronic ISSN
Publisher
Pergamon Press
Volume
14
Issue
2
Pages
181 - 192
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
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.