COMPUTING OPTIMAL LOT SIZES IN THE ECONOMIC LOT SCHEDULING PROBLEM

• 成果类型: Article
• 署名作者: ZIPKIN, PH
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.39.1.56
• 发表日期: 1991
• 页码: 56-63
• 关键词: INVENTORY; Production; MULTIITEM; ECONOMIC LOT SCHEDULING; programming; QUADRATIC; APPLICATION TO PRODUCTION SCHEDULING

摘要

This paper treats a version of the Economic Lot Scheduling Problem (ELSP) in which items may be produced several times in different amounts during a cycle. We show how to compute the optimal lot sizes and cycle length, given the sequence of items in a cycle. This requires solving a parametric quadratic program, plus a few EOQ calculations. Our procedure is designed to be used along with a heuristic for selecting the sequence of items in a cycle, such as the one proposed in 1987 by G. Dobson. The two algorithms together comprise a simple, plausible heuristic for the ELSP as a whole.