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

Authors:
Stefan Chanas;Paweł ZielińSki
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland;Institute of Mathematics, Technical University of Opole, Luboszycka 3, 45-036 Opole, Poland
Venue:
Operations Research Letters
Year:
2003

Citing 2
Cited 8

Critical-path planning and scheduling

IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
The robust spanning tree problem with interval data

Operations Research Letters

Solving Fuzzy PERT Using Gradual Real Numbers

Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
The minimum risk spanning tree problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Criticality analysis of activity networks under interval uncertainty

Journal of Scheduling
Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks

INFORMS Journal on Computing
A path enumeration approach for the analysis of critical activities in fuzzy networks

Information Sciences: an International Journal
The robust shortest path problem in series-parallel multidigraphs with interval data

Operations Research Letters
On the Latest Times and Float Times of Activities in a Fuzzy Project Network with LR Fuzzy Numbers

International Journal of Fuzzy System Applications
Fast minimum float computation in activity networks under interval uncertainty

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.