|
|||||
|
|
Complexity of two dual criteria scheduling problems |
|
| Authors: | Yumei Huo Hairong Zhao |
| Affiliation: | a Department of Computer Science, College of Staten Island, CUNY, Staten Island, New York 10314, USA b Department of Computer Science, New Jersey Institute of Technology, Newark NJ 07102, USA c Department of Mathematics, Computer Science & Statistics, Purdue University, Calumet 2200 169th Street, Hammond, IN 46323, USA |
| Abstract: | In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard. |
| Keywords: | NP-hard Dual criteria Single machine |
| 本文献已被 ScienceDirect 等数据库收录！ | |