CAJ | 학술논문

有限能力分批计划问题(Capacitated Dynamic Lot-SizingProblem,CLSP)是解决MRPⅡ批量计划与能力计划不一致的有效方法。通过引入罚函数将有能力约束的CLSP转化为无能力约束的问题(Uncapacitated Lot-Sizing Problem,ULSP),应用一种改进的遗传算法求解转化后的ULSP。某加工车间的实际应用验证了该方法的有效性
유한능력분비계화문제(Capacitated Dynamic Lot-SizingProblem,CLSP)시해결MRPⅡ비량계화여능력계화불일치적유효방법。통과인입벌함수장유능력약속적CLSP전화위무능력약속적문제(Uncapacitated Lot-Sizing Problem,ULSP),응용일충개진적유전산법구해전화후적ULSP。모가공차간적실제응용험증료해방법적유효성
Capacitated dynamic lot-sizing problem (CLSP) is an effectivemethodology to deal with inconsistent between lot-sizing and capacity planning. By using penalty function the CLSP is transferred into an uncapacitated lot-sizing problems (ULSP). A multi-level annealing genetic algorithm (MLAGA) is proposed to solve the transferred ULSP. The result of a real world example for a machine shop shows that the algorithm is effective.