Premium
Two heuristics for the economic lot scheduling problem: An experimental study
Author(s) -
Geng P. C.,
Vickson R. G.
Publication year - 1988
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198808)35:4<605::aid-nav3220350412>3.0.co;2-v
Subject(s) - heuristics , mathematical optimization , computer science , scheduling (production processes) , heuristic , job shop scheduling , mathematics , schedule , operating system
In this article we present and test two heuristics for the economic lot scheduling problem. The first heuristic was developed by one of us (P.C. Geng) during Ph.D. research, while the other is a convergent implementation of an algorithm due to Doll and Whybark. We study the performance of these heuristics on a large set of test problems constructed using a new form of problem generation that yields random problems within an experimental design.