| Article ID: | iaor20022755 |
| Country: | Netherlands |
| Volume: | 136 |
| Issue: | 3 |
| Start Page Number: | 541 |
| End Page Number: | 550 |
| Publication Date: | Feb 2002 |
| Journal: | European Journal of Operational Research |
| Authors: | Chanas Stefan, Zieliski Pawel |
| Keywords: | computational analysis |
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 duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented.