Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Geng et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: