A network flow algorithm for just-in-time project scheduling (Q1342048): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Arkadi Nemirovski / rank
Normal rank
 
Property / author
 
Property / author: Arkadi Nemirovski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966751355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal project compression with due-dated events / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERT and crashing revisited: Mathematical generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow Computation for Project Cost Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352816 / 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: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow algorithm for just-in-time project scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:19, 23 May 2024

scientific article
Language Label Description Also known as
English
A network flow algorithm for just-in-time project scheduling
scientific article

    Statements

    A network flow algorithm for just-in-time project scheduling (English)
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    just-in-time
    0 references
    out-of-kilter algorithm
    0 references
    project scheduling
    0 references
    pseudo-linear complexity
    0 references

    Identifiers