| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143178 | Operations Research Letters | 2007 | 10 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yumei Huo, J.Y.-T. Leung, Hairong Zhao,