Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q3455883)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6520093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs |
scientific article; zbMATH DE number 6520093 |
Statements
Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (English)
0 references
11 December 2015
0 references
project scheduling
0 references
time-cost tradeoff
0 references
uncertain processing times
0 references
computational complexity
0 references
0 references
0 references
0 references
0.8573161959648132
0 references
0.8300754427909851
0 references
0.7937915921211243
0 references
0.7824695706367493
0 references
0.7808761596679688
0 references
