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

• Type: Journal
• Year: 2002
• Where: EOR
• Authors: Stefan Chanas, Pawel Zielinski
• Keywords: Criticality Notion, Duration Times, EOR 2002, Interval Activities Duration