6533b831fe1ef96bd1298371
RESEARCH PRODUCT
On the hardness of evaluating criticality of activities in a planar network with duration intervals
Paweł ZielińskiStefan Chanassubject
Planar networkFloat (project management)PlanarCriticalityComputer scienceDuration timeApplied MathematicsReal-time computingManagement Science and Operations ResearchDuration (project management)Industrial and Manufacturing EngineeringSoftwareSimulationdescription
Complexity results for problems of evaluating the criticality of activities in planar networks with duration time intervals are presented. We show that the problems of asserting whether an activity is possibly critical, and of computing bounds on the float of an activity in these networks are NP-complete and NP-hard, respectively.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-01-01 | Operations Research Letters |