| 三行N元基本网格的最优解法 |
| |
| 引用本文： | 乞建勋,张雅琴. 三行N元基本网格的最优解法[J]. 现代电力, 1994, 0(3) |
| |
| 作者姓名： | 乞建勋 张雅琴 |
| |
| 作者单位： | 华北电力学院，北京动力经济学院 |
| |
| 摘 要： | ３零件Ｎ道工艺（或Ｎ台机器）的顺序排序问题，是一个复杂的组合优化问题。文章利用关键路方法中网络计划图的特点，设计出一种新的计算方法，该种方法对解决“３个零件Ｎ道工艺”等问题十分简便、实用，又能保证排序结果的最优性。
|
| 关 键 词： | 组合优化，关键路方法，时间优化，网格 |
A NEW METHOD OF OPTIMIZATION FOR THE THREE-ROW AND N-ELEMENT BASIC NETWORK |
| |
| Qi Jianxun,Zhang Yaqin. A NEW METHOD OF OPTIMIZATION FOR THE THREE-ROW AND N-ELEMENT BASIC NETWORK[J]. Modern Electric Power, 1994, 0(3) |
| |
| Authors: | Qi Jianxun Zhang Yaqin |
| |
| Affiliation: | Qi Jianxun;Zhang Yaqin |
| |
| Abstract: | It is a complex problem of combinational optimization to permute three machine parts into N working operations.By using the special features of the programming diagram of CPM network,a new algorithm for such problem is designed and presented in this paper.The practical example of computation shows the merits of the new approach:simplicity of its computation process and its high usability. |
| |
| Keywords: | combinational optimization key path method time optimization network |
| 本文献已被 CNKI 等数据库收录！ |
