Title of article :
On the complexity of minimizing the number of late jobs in unit time open shop
Author/Authors :
Svetlana A. Kravchenko، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
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.
Keywords :
Unary NP-hard , Open-shop
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
