Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs (Q3455883)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs |
scientific article |
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
