Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924)
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: Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization |
scientific article; zbMATH DE number 5642749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization |
scientific article; zbMATH DE number 5642749 |
Statements
Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (English)
0 references
7 December 2009
0 references
genetic algorithm
0 references
permutation flowshop
0 references
total flowtime
0 references
scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0.9269946
0 references
0 references
0.91913855
0 references
0 references
0.9149815
0 references
0.9131433
0 references
0 references
0.91217035
0 references
