Title of article :
The computational complexity of the criticality problems in a network with interval activity times
Author/Authors :
Stefan Chanas، نويسنده , , Pawe Zieli ski، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
10
From page :
541
To page :
550
Keywords :
Project management and scheduling , Interval criticality , Interval CPM , complexity theory
Journal title :
European Journal of Operational Research
Serial Year :
2002
Journal title :
European Journal of Operational Research
Record number :
213959
Link To Document :
بازگشت