Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6890258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic algorithms for the minmax regret flow-shop problem with interval processing times |
scientific article; zbMATH DE number 6890258 |
Statements
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (English)
0 references
15 June 2018
0 references
flow-shop
0 references
interval processing times
0 references
minmax regret
0 references
heuristic algorithms
0 references
computational experiments
0 references
0 references
0 references
0 references
0 references
0.8653469085693359
0 references
0.8356783390045166
0 references
0.807339608669281
0 references
0.8021160960197449
0 references
0.7882168889045715
0 references
