The computational complexity of the criticality problems in a network with interval activity times (Q5953342): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of fuzzy variables in PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical path analysis in the network with fuzzy activity times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On criticality and sensitivity in activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy-Network Planning - FNET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Selection in <i>X</i> + <i>Y</i> and Other Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the expected completion time of PERT networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normally Distributed Activity Durations in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic and fuzzy PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Technique for Research and Development Program Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fuzzy set theory in a scheduling problem: A case study / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:24, 3 June 2024

scientific article; zbMATH DE number 1694119
Language Label Description Also known as
English
The computational complexity of the criticality problems in a network with interval activity times
scientific article; zbMATH DE number 1694119

    Statements

    The computational complexity of the criticality problems in a network with interval activity times (English)
    0 references
    0 references
    0 references
    23 January 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    project management and scheduling
    0 references
    complexity theory
    0 references
    interval criticality
    0 references
    interval CPM
    0 references