能力受限的批量问题的数学模型与算法新进展

Advances of Mathematical Models and Algorithms of Capacitated Lot-Sizing Problems

古典库存问题和能力无限的单层批量问题的研究已经有几十年的历史了,但由于实际生产中产品结构往往比较复杂、生产能力总是有限的,因此能力受限的批量问题(尤其是多层批量问题)成为了近年来运筹学、管理科学和工业工程等领域的研究热点之一.本文在综合大量国内外有关文献的基础上,对一般批量问题的数学模型作了比较系统、全面的介绍,重点讨论能力受限的单层批量问题和多层批量问题的一些新算法,并指出一些值得深入研究和努力实践的新方向.

The capacitated lot-sizing (and scheduling) problem (CLSP) is becoming more and more interested by researchers in the fields of operations research (OR),management science (MS), and industrial engineering (IE),etc..This paper surveys the main investigations of CLSP, especially recent advances of the mathematical models and the solving algorithms of CLSP. Some new directions for further researches and applications are also given.