| 关于并列管道型机器排序的复杂性 |
| |
| 引用本文： | 高润霞.关于并列管道型机器排序的复杂性[J].阜阳师范学院学报(自然科学版),2002,19(3):12-14,28. |
| |
| 作者姓名： | 高润霞 |
| |
| 作者单位： | 安庆师范学院,安庆,246003 |
| |
| 摘 要： | 考虑一个有两个功能部件的机器模型,每个部件要么是有序的,要么类似于管道并列的。关于这类机器模型的3个 NP-完成结果在1]中有所阐述。本文说明的是当先前限制因素和其他限制因素削弱时,这三个NP-完成结果仍然正确。
|
| 关 键 词： | NP-完成 多功能部件机器 管道型机器 资源限制 |
| 文章编号： | 1004-4329(2002)03-0012-03 |
On the Complexity of Scheduling Problems for Parallal Pipelined Machines |
| |
| Gao Runxia.On the Complexity of Scheduling Problems for Parallal Pipelined Machines[J].Journal of Fuyang Teachers College:Natural Science,2002,19(3):12-14,28. |
| |
| Authors: | Gao Runxia |
| |
| Abstract: | In a machine model with two functional units,each can be either sequential or pipelined. Three NP-completeness results on such machine model have been represented in1].It is shown in this article that the three NP-completeness results remain true when precedence constrants and other constraints are weakened. |
| |
| Keywords: | NP-completeness Machines with several functional units Pipelined machines Resource constraints |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
