离散制造业中生产批量计划问题的模型与算法

计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (19): 214-218.

离散制造业中生产批量计划问题的模型与算法

韩毅

1.华中科技大学管理学院，武汉 430074
2.浙江工业大学经贸管理学院，杭州 310023

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-07-01 发布日期:2011-07-01

Summary of mathematical models and algorithms of lot-sizing problem in discrete manufacturing enterprises

HAN Yi

1.School of Management，Huazhong University of Science & Technology，Wuhan 430074，China
2.College of Economics and Management，Zhejiang University of Technology，Hangzhou 310023，China

Received:1900-01-01 Revised:1900-01-01 Online:2011-07-01 Published:2011-07-01

摘要/Abstract

摘要： 制造业是衡量一个国家和地区的综合经济实力和发展水平的重要标准，是民生之本和产业主体。制造业的重要组成成分之一是离散制造业，其中的重要问题是生产批量计划问题（Lot-sizing Problem，LP）。生产批量计划问题是企业生产过程中的重要决策问题，与运筹学、管理科学和工业工程等领域联系紧密。迄今为止，国内外学者对该问题的研究历史已超过50年。在参考国内外相关文献的基础上，对生产批量计划问题的模型和求解算法作了系统、全面的总结，指出了将来可以进一步研究的重点方向。

关键词: 经济实力, 离散制造业, 生产批量计划问题, 运筹学, 工业工程

Abstract:

Manufacturing Industry（MI） is an important meteyard for evaluating the synchronized economic standing and development level.It is also the root of people’s well-beings and the main body of production enterprises.Discrete Manufacturing Industry（DMI） is one of the main components of MI，the most significant problem among which is Lot-sizing Problem（LP）.In the production scheduling systems，LP is a crucial decisive problem.LP keeps close relationship with Operations Research（OR），management science，industry engineering and etc.So far，the history of researchs on LP from domestic and foreign scholars has beyond 50 years.This paper surveys some studies of LP and introduces the mathematical models and algorithms in detail.Furthermore，the potential directions for further researches and applications are presented.

Key words: economic standing, discrete manufacturing enterprises, lot-sizing problem, operations research, industry engineering

韩毅. 离散制造业中生产批量计划问题的模型与算法[J]. 计算机工程与应用, 2011, 47(19): 214-218.

HAN Yi. Summary of mathematical models and algorithms of lot-sizing problem in discrete manufacturing enterprises[J]. Computer Engineering and Applications, 2011, 47(19): 214-218.