Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262)
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: Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage |
scientific article; zbMATH DE number 6310829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage |
scientific article; zbMATH DE number 6310829 |
Statements
Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (English)
0 references
30 June 2014
0 references
hybrid flow shop
0 references
open shop
0 references
heuristic algorithm
0 references
0.9496762
0 references
0.90448797
0 references
0.9038444
0 references
0.90293163
0 references
0.89904785
0 references
0.89820325
0 references
0.88901496
0 references
