The computational complexity of the criticality problems in a network with interval activity times
From MaRDI portal
Publication:5953342
DOI10.1016/S0377-2217(01)00048-0zbMath1008.90029OpenAlexW1969972122MaRDI QIDQ5953342
Stefan Chanas, Paweł Zieliński
Publication date: 23 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00048-0
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)
Related Items (27)
Analysis of critical paths in a project network with fuzzy activity times ⋮ On combinatorial optimization problems on matroids with uncertain weights ⋮ Fast minimum float computation in activity networks under interval uncertainty ⋮ Risk models for the prize collecting Steiner tree problems with interval data ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ Measuring component importance for network system using cellular automata ⋮ Optimization problems with evidential linear objective ⋮ Criticality analysis of activity networks under interval uncertainty ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ Fuzzy shortest path problems incorporating interactivity among paths. ⋮ Intuitionistic fuzzy multi-criteria group decision making with an application to critical path selection ⋮ Solution of interval PERT/CPM network problems by a simplified tabular method ⋮ Fuzzy reliability analysis using cellular automata for network systems ⋮ 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 minmax regret approach to the critical path method with task interval times ⋮ Project risk management from the bottom-up: activity risk index ⋮ Simplifying activity networks under generalized precedence relations to extended CPM networks ⋮ The minimum spanning tree problem with fuzzy costs ⋮ A simple approach to fuzzy critical path analysis in project networks ⋮ Some methods for evaluating the optimality of elements in matroids with ill-known weights ⋮ 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 ⋮ Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge ⋮ On latest starting times and floats in activity networks with ill-known durations ⋮ On the hardness of evaluating criticality of activities in a planar network with duration intervals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An upper bound on the expected completion time of PERT networks
- The use of fuzzy variables in PERT
- Using fuzzy set theory in a scheduling problem: A case study
- On criticality and sensitivity in activity networks
- Stochastic and fuzzy PERT
- Fuzzy-Network Planning - FNET
- Critical-Path Planning and Scheduling: Mathematical Basis
- Normally Distributed Activity Durations in PERT Networks
- `` Strong NP-Completeness Results
- Lower Bounds for Selection in X + Y and Other Multisets
- Application of a Technique for Research and Development Program Evaluation
- Critical path analysis in the network with fuzzy activity times
This page was built for publication: The computational complexity of the criticality problems in a network with interval activity times
