On the hardness of evaluating criticality of activities in a planar network with duration intervals

On the hardness of evaluating criticality of activities in a planar network with duration intervals

0.00 Avg rating0 Votes
Article ID: iaor2004374
Country: Netherlands
Volume: 31
Issue: 1
Start Page Number: 53
End Page Number: 59
Publication Date: Jan 2003
Journal: Operations Research Letters
Authors: ,
Keywords: complexity
Abstract:

Complexity results for problems of evaluating the criticality of activities in planar networks with duration time intervals are presented. We show that the problems of asserting whether an activity is possibly critical, and of computing bounds on the float of an activity in these networks are NP–complete and NP–hard, respectively.

Reviews

Required fields are marked *. Your email address will not be published.