Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (Q5059417)
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 7637174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping |
scientific article; zbMATH DE number 7637174 |
Statements
Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping (English)
0 references
23 December 2022
0 references
shuffled frog-leaping algorithm
0 references
distributed scheduling
0 references
two-stage hybrid flowshop scheduling problem
0 references
sequence-dependent setup times
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8250724673271179
0 references
0.8040269613265991
0 references
0.7941071391105652
0 references
0.7737070918083191
0 references
0.7673767805099487
0 references
