Minimizing task completion time with the execution set method (Q2467305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Critical path in an activity network with time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Application of a Technique for Research and Development Program Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the critical path in an activity network with time-switch constraints / rank
 
Normal rank

Latest revision as of 15:35, 27 June 2024

scientific article
Language Label Description Also known as
English
Minimizing task completion time with the execution set method
scientific article

    Statements

    Minimizing task completion time with the execution set method (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    networks/graphs: applications
    0 references
    linear programming optimization
    0 references
    0 references