On the hardness of evaluating criticality of activities in a planar network with duration intervals

DOI10.1016/S0167-6377(02)00174-8zbMath1036.90024MaRDI QIDQ1870004

Paweł Zieliński, Stefan Chanas

Publication date: 4 May 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

ComplexityProject management and schedulingData intervals

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items (12)

Analysis of critical paths in a project network with fuzzy activity times ⋮ Fast minimum float computation in activity networks under interval uncertainty ⋮ Criticality analysis of activity networks under interval uncertainty ⋮ Solution of interval PERT/CPM network problems by a simplified tabular method ⋮ On computing the latest starting times and floats of activities in a network with imprecise durations ⋮ A path enumeration approach for the analysis of critical activities in fuzzy networks ⋮ On the latest starting times and criticality of activities in a network with imprecise durations ⋮ A polynomial solvable minimum risk spanning tree problem with interval data ⋮ A simple approach to fuzzy critical path analysis in project networks ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ Computing latest starting times of activities in interval-valued networks with minimal time lags ⋮ The robust shortest path problem in series -- parallel multidigraphs with interval data

Cites Work

• Unnamed Item
• The robust spanning tree problem with interval data
• Critical path analysis in the network with fuzzy activity times
• The computational complexity of the criticality problems in a network with interval activity times

This page was built for publication: On the hardness of evaluating criticality of activities in a planar network with duration intervals