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

DOI10.1016/S0167-6377(02)00174-8zbMATH Open1036.90024MaRDI QIDQ1870004FDOQ1870004

Authors: Paweł Zieliński, Stefan Chanas 

Publication date: 4 May 2003

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

Recommendations

• The computational complexity of the criticality problems in a network with interval activity times
• Criticality analysis of activity networks under interval uncertainty
• On the latest starting times and criticality of activities in a network with imprecise durations
• On the computational complexity of the minimum-dummy-activities problem in a pert network
• Critical path in an activity network with time constraints

zbMATH Keywords

ComplexityProject management and schedulingData intervals

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The robust spanning tree problem with interval data
• The computational complexity of the criticality problems in a network with interval activity times
• Critical path analysis in the network with fuzzy activity times

Cited In (14)

• Fast minimum float computation in activity networks under interval uncertainty
• Approximating the Criticality Indices of the Activities in PERT Networks
• Criticality analysis of activity networks under interval uncertainty
• The computational complexity of the criticality problems in a network with interval activity times
• A polynomial solvable minimum risk spanning tree problem with interval data
• 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
• A simple approach to fuzzy critical path analysis in project networks
• On the latest starting times and criticality of activities in a network with imprecise durations
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• On computing the latest starting times and floats of activities in a network with imprecise durations
• Analysis of critical paths in a project network with fuzzy activity times
• A path enumeration approach for the analysis of critical activities in fuzzy networks
• Solution of interval PERT/CPM network problems by a simplified tabular method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870004)