Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating a two-machine flow shop scheduling under discrete scenario uncertainty |
scientific article |
Statements
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (English)
0 references
16 August 2012
0 references
combinatorial optimization
0 references
scheduling
0 references
approximation
0 references
robust optimization
0 references
flow shop
0 references
