| 一类排序问题的计算复杂性 |
| |
| 引用本文： | 江厚元.一类排序问题的计算复杂性[J].贵州工业大学学报(自然科学版),1990(2). |
| |
| 作者姓名： | 江厚元 |
| |
| 作者单位： | 贵州工学院基础科学部 |
| |
| 摘 要： | 本文讨论一类新的确定性排序问题。但与古典排序问题不同,2]3]讨论了求最小加工时间的排序问题。本文将对一类简单的具有可加工时间和应交工期限的排序问题进行讨论,并给出它们的计算复杂性。
|
| 关 键 词： | 排序问题 最小延误时间 NP-完全 |
The Complexity of a kind of Scheduling Problems |
| |
| Jiang Houyuan.The Complexity of a kind of Scheduling Problems[J].Journal of Guizhou University of Technology(Natural Science Edition),1990(2). |
| |
| Authors: | Jiang Houyuan |
| |
| Institution: | Department of Basic Sciences |
| |
| Abstract: | A kind of new scheduling problems are studied in this paper,which are different from the classic ones.This paper gives several optimazation algorithms for a kind of scheduling problems with different release time and diffrent deadlines. |
| |
| Keywords: | scheduling problem minimum lateness NP-complete |
| 本文献已被 CNKI 等数据库收录！ |
