Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs |
scientific article; zbMATH DE number 6597004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs |
scientific article; zbMATH DE number 6597004 |
Statements
Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (English)
0 references
23 June 2016
0 references
project scheduling
0 references
time-cost tradeoff
0 references
computational complexity
0 references
chain precedence graph
0 references
0.9138021469116212
0 references
0.8683609962463379
0 references
0.8573161959648132
0 references
0.8010727167129517
0 references
0.790066659450531
0 references
