A network flow algorithm for just-in-time project scheduling (Q1342048): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
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
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