Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion |
scientific article |
Statements
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (English)
0 references
2 October 2018
0 references
robust optimization
0 references
scheduling
0 references
uncertainty
0 references
computational complexity
0 references
0 references
0 references
0 references
