| Article ID: | iaor20013318 |
| Country: | Netherlands |
| Volume: | 100 |
| Issue: | 1/2 |
| Start Page Number: | 127 |
| End Page Number: | 132 |
| Publication Date: | Mar 2000 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Kravchenko Svetlana A. |
The complexity status of unit time open shop with release dates and the minimal number of late jobs criterion is investigated here. It is shown by reduction from 3-partition, that this problem is unary NP-hard.