Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 136, Issue 3, Pages 541-550Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(01)00048-0
Keywords
project management and scheduling; complexity theory; interval criticality; interval CPM
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available