Title of article :
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Author/Authors :
Berit Johannes، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 2005
Pages :
10
From page :
587
To page :
596
Keywords :
OR-networks , Precedence constraints , Scheduling , computational complexity
Journal title :
Operations Research Letters
Serial Year :
2005
Journal title :
Operations Research Letters
Record number :
137637
Link To Document :
بازگشت