摘要
ＣＬＳＰ（Ｍｕｌｔｉ－ｉｔｅｍｓｉｎｇｌｅ－ｌｅｖｅｌｃａｐａｃｉｔａｔｅｄｄｙｎａｍｉｃｌｏｔ－ｓｉｚｉｎｇｐｒｏｂｌｅｍ）是在受能力约束限制下，确定Ｎ种不同的项目在给定的计划范围Ｔ内的每一个时间段批量，使得在整个计划范围内（Ｐｌａｎ－ｎｉｎｇＨｏｒｉｚｏｎ）项目总的调整费用和库存保管费用以及生产费用之和最小。本文采用遗传算法和线性规划结合来求解带多资源的ＣＬＳＰ问题。
The sigle level capacitated dynamic lot sizing problem is to determine production lot sizes of N item over periods that minimizes the sum of setup costs and inventory holding costs over the planning horizon, while satisfying capacity constraints.In this paper, we propose algorithms to combine Genetic algorithm with Linear Programming for solve CLSP with multi resources in CIMS, At last, an example is given.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1997年第4期39-44,共6页
Systems Engineering-Theory & Practice
关键词
CLSP
遗传算法
线性规划
计算机集成制造
CIMS/MRP-Ⅱ
CLSP with multi resources
genetic algorithms
linear programming
