The computational complexity of the criticality problems in a network with interval activity times
- 1 February 2002
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 136 (3), 541-550
- https://doi.org/10.1016/s0377-2217(01)00048-0
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Critical path analysis in the network with fuzzy activity timesFuzzy Sets and Systems, 2001
- On criticality and sensitivity in activity networksEuropean Journal of Operational Research, 2000
- Stochastic and fuzzy PertEuropean Journal of Operational Research, 1989
- Normally Distributed Activity Durations in PERT NetworksJournal of the Operational Research Society, 1985
- An upper bound on the expected completion time of PERT networksEuropean Journal of Operational Research, 1985
- Fuzzy-Network Planning - FNETIEEE Transactions on Reliability, 1983
- The use of fuzzy variables in pertFuzzy Sets and Systems, 1981
- Lower Bounds for Selection in X + Y and Other MultisetsJournal of the ACM, 1978
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Critical-Path Planning and Scheduling: Mathematical BasisOperations Research, 1961