Article ID: | iaor20081740 |
Country: | Netherlands |
Volume: | 35 |
Issue: | 2 |
Start Page Number: | 211 |
End Page Number: | 220 |
Publication Date: | Mar 2007 |
Journal: | Operations Research Letters |
Authors: | Leung J.Y.-T., Huo Yumei, Zhao Hairong |
Keywords: | combinatorial analysis |
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.