6533b827fe1ef96bd12864c5
RESEARCH PRODUCT
The computational complexity of the criticality problems in a network with interval activity times
Stefan ChanasPaweł Zielińskisubject
Discrete mathematicsInformation Systems and ManagementTheoretical computer scienceGeneral Computer ScienceComputational complexity theoryGeneralizationEvent (relativity)Interval (mathematics)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringCriticalityModeling and SimulationPath (graph theory)Computation complexityDuration (project management)Mathematicsdescription
Abstract 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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2002-02-01 | European Journal of Operational Research |