摘要
】ＣＬＳＰ是在受能力约束限制下，确定Ｎ种不同的项目在给定的计划范围Ｔ内的第一个时间段批量，使得在整个计划范围内项目总的调整费用和库存保管费用以及生产费用之和最小。采用遗传算法和线性规划结合来求解ＣＬＳＰ问题。
The sigle level capacitated dynamic lot sizing problem is to determine production lot sizes of N items over periods that minimzes the sum of setup costs and inventory holding costs over the planning period, while satisfying capacity constraints. In this paper, we propose algorithms to combine genetic algorithm with linear progromming for solve CLSP in CIMS, at last, an example is given.
出处
《系统工程理论方法应用》
1998年第2期30-34,共5页
Systems Engineering Theory·Methodology·Applications
基金
国家自然科学基金
国家863资助项目
