Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193)
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 of interval minmax regret scheduling on parallel identical machines with total completion time criterion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8912323713302612
0 references
0.8847776055335999
0 references
0.8656456470489502
0 references
0.8563589453697205
0 references
