| CIMS中带多资源的CLSP问题的遗传启发式算法 |
| |
| 引用本文： | 唐立新,杨自厚,王梦光,祁慧.CIMS中带多资源的CLSP问题的遗传启发式算法[J].系统工程理论与实践,1997,17(4):40-45. |
| |
| 作者姓名： | 唐立新 杨自厚 王梦光 祁慧 |
| |
| 作者单位： | 1. 东北大学自动控制系2. 沈阳人民广播电台 |
| |
| 摘 要： | ＣＬＳＰ（Ｍｕｌｔｉ－ｉｔｅｍｓｉｎｇｌｅ－ｌｅｖｅｌｃａｐａｃｉｔａｔｅｄｄｙｎａｍｉｃｌｏｔ－ｓｉｚｉｎｇｐｒｏｂｌｅｍ）是在受能力约束限制下，确定Ｎ种不同的项目在给定的计划范围Ｔ内的每一个时间段批量，使得在整个计划范围内（Ｐｌａｎ－ｎｉｎｇＨｏｒｉｚｏｎ）项目总的调整费用和库存保管费用以及生产费用之和最小。本文采用遗传算法和线性规划结合来求解带多资源的ＣＬＳＰ问题。
|
| 关 键 词： | CIMS／MRP－Ⅱ 带多资源的CLSP 遗传算法 线性规划 |
| 收稿时间： | 1995-09-28 |
New Genetic Heuristic Algorithms to Solve CLSP with Multi Resources in CIMS |
| |
| Tang Lixin,Yang Zihou,Wang Mengguang.New Genetic Heuristic Algorithms to Solve CLSP with Multi Resources in CIMS[J].Systems Engineering —Theory & Practice,1997,17(4):40-45. |
| |
| Authors: | Tang Lixin Yang Zihou Wang Mengguang |
| |
| Institution: | 1. Northeast University,Shenyany 1100062. Shenyang Radio Station 110032 |
| |
| Abstract: | 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. |
| |
| Keywords: | CIMS/MRP-Ⅱ CLSP with multi resources genetic algorithms linear programming |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
