A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449)
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: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs |
scientific article; zbMATH DE number 6633545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs |
scientific article; zbMATH DE number 6633545 |
Statements
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (English)
0 references
6 October 2016
0 references
project scheduling
0 references
time-cost tradeoff
0 references
computational complexity
0 references
completely ordered jobs
0 references
0 references
0.9138021469116212
0 references
0.8300754427909851
0 references
0.8238001465797424
0 references
0.780758261680603
0 references
0.7787405252456665
0 references
