| 新的Lagrangian松弛法求解CLSP问题 |
| |
| 引用本文： | 唐立新,杨自厚,王梦光.新的Lagrangian松弛法求解CLSP问题[J].系统工程学报,1999,14(1):9-14. |
| |
| 作者姓名： | 唐立新 杨自厚 王梦光 |
| |
| 作者单位： | 东北大学系统工程研究所,沈阳,110006 |
| |
| 基金项目： | 国家自然科学基金,国家863／CIMS资助 |
| |
| 摘 要： | ＣＬＳＰ是在受能力约束限制下，确定Ｎ种不同的项目在给定的计划范围Ｔ内的第一时间段批量，使得在整个计划范围内项目总的调整费用和库存保管费用以及生产费用之和最小。
|
| 关 键 词： | 批量计划 Lagrangian CLSP问题 CIMS |
NEW LAGRANGIAN RELAXATION ALGORITHMS TO SOLVE CLSP |
| |
| Tang Lixin,Yang Zihou,Wang Mengguang.NEW LAGRANGIAN RELAXATION ALGORITHMS TO SOLVE CLSP[J].Journal of Systems Engineering,1999,14(1):9-14. |
| |
| Authors: | Tang Lixin Yang Zihou Wang Mengguang |
| |
| Abstract: | The single level capacitated dynamic lot sizing problem is to determine production lot sizes of N itme 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 have developed a Lagrangian relaxation based new heuristic algorithms to generate near optimal solutions to CLSP.Computational results of 10 tested problems show that the average duality gaps are within 2%. |
| |
| Keywords: | lot sizing CLSP Lagrangian relaxation new heurisitc |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
