Title of article :
On complexity of minimizing weighted number of late jobs in unit time open shops
Author/Authors :
A.A. Gladky، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
We show that the problem of minimizing the weighted number of late jobs in open shop with given release dates and unit time operations is strongly NP-hard. The complexity status of this problem was unknown.
Keywords :
Open shop , Unit processing times , View the MathML source-hard problem
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
