Title of article :
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Author/Authors :
Berit Johannes، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2005
Keywords :
OR-networks , Precedence constraints , Scheduling , computational complexity
Journal title :
Operations Research Letters
Journal title :
Operations Research Letters