The computational complexity of the criticality problems in a network with interval activity times

The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) for the case of network with interval activity duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented. (C) 2002 Elsevier Science B.V. All rights reserved.