Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of minimizing the total flow time with interval data and minmax regret criterion |
scientific article |
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
