A comparison of discrete, single stage lot-sizing heuristics with special emphasis on rules based on the marginal cost principle
暂无分享,去创建一个
Abstract Several lot-sizing techniques suitable for use in connection with time-phased inventory records have been suggested in the last few years. The common denominator for most of these rules is their foundation in the principle of equating marginal costs per unit of time. After outlining the structures of six recent lot size models, this paper presents the results from a large simulation experiment involving a total of eleven discrete rules. It is shown that the lot-sizing techniques based on marginal costs clearly outperform the more well known rules like Part Period Balancing and Least Unit Cost, and actually rank number 2, 3, 4, 5, and 8 after the optimizing Wagner-Whitin algorithm.
[1] Urban Wemmerlov,et al. The Ubiquitous EOQ — Its Relation to Discrete Lot Sizing Heuristics , 1981 .
[2] John J. DeMatteis. An Economic Lot-Sizing Technique I: The Part-Period Algorithm , 1968, IBM Syst. J..
[3] D. Collier. A comparison of MRP lot sizing methods considering capacity change costs , 1980 .
[4] Bruce Jay McLaren,et al. A study of multiple level lot sizing procedures for material requirements planning systems , 1977 .