Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (Q846170)
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 5665093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search |
scientific article; zbMATH DE number 5665093 |
Statements
Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search (English)
0 references
1 February 2010
0 references
multiprocessor task scheduling
0 references
hybrid flow-shop
0 references
genetic algorithm
0 references
constraint programming
0 references
memetic algorithm
0 references
0 references
0 references
0 references
0.8113898634910583
0 references
0.797243058681488
0 references
0.7865828275680542
0 references
0.7806177139282227
0 references
0.7779141664505005
0 references
