| 一类装配式作业排序问题计算复杂性研究 |
| |
| 引用本文： | 吕绪华,潘开灵.一类装配式作业排序问题计算复杂性研究[J].武汉科技大学学报(自然科学版),1998(4). |
| |
| 作者姓名： | 吕绪华 潘开灵 |
| |
| 作者单位： | 武汉冶金科技大学管理工程系 |
| |
| 摘 要： | 探讨装配式作业排序问题的计算复杂性，证明了在优化指标为作业排序长度的条件下该问题是ＮＰ－完全问题。
|
| 关 键 词： | 复合并行机排序 计算复杂性 NP－完全问题 装配式作业 |
Study on the Computational Complexity of Scheduling Problem in Assembly Shop |
| |
| Lu Xuhua,Pan Kailing.Study on the Computational Complexity of Scheduling Problem in Assembly Shop[J].Journal of Wuhan University of Science and Technology(Natural Science Edition),1998(4). |
| |
| Authors: | Lu Xuhua Pan Kailing |
| |
| Institution: | Lu Xuhua Pan Kailing |
| |
| Abstract: | This paper explores into the computational complexity of scheduling problem in assembly flow shop.It has proved that the problem is of NP complete problem when the optimization objective involves the make span. |
| |
| Keywords: | scheduling multi processor tasks computational complexity NP complete problem assembly flow shop |
| 本文献已被 CNKI 等数据库收录！ |
