Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320)
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: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty |
scientific article; zbMATH DE number 6066758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating a two-machine flow shop scheduling under discrete scenario uncertainty |
scientific article; zbMATH DE number 6066758 |
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
0 references
0 references
0 references
0 references
0 references
0.91542983
0 references
0.8977868
0 references
0.8948733
0 references
0.8902407
0 references
0 references
0.88696945
0 references
0.8864135
0 references
0.88599825
0 references
0.88485605
0 references
