Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804)
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 minimizing the total flow time with interval data and minmax regret criterion |
scientific article; zbMATH DE number 5068596
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of minimizing the total flow time with interval data and minmax regret criterion |
scientific article; zbMATH DE number 5068596 |
Statements
Complexity of minimizing the total flow time with interval data and minmax regret criterion (English)
0 references
30 October 2006
0 references
minmax regret
0 references
robust scheduling
0 references
uncertainty
0 references
complexity
0 references
0 references
0.9223842
0 references
0.90023524
0 references
0.88891405
0 references
0.8851495
0 references
0 references
0.8787216
0 references
0.8756764
0 references
0.8747519
0 references
0.8737975
0 references
