Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643)
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: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm |
scientific article; zbMATH DE number 5248445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm |
scientific article; zbMATH DE number 5248445 |
Statements
Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (English)
0 references
12 March 2008
0 references
Bi-criteria permutation flow shop scheduling
0 references
Multi-objective shuffled frog-leaping algorithm
0 references
Multi-objective genetic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.849494218826294
0 references
0.8414484262466431
0 references
0.8403981328010559
0 references
0.8066979050636292
0 references
0.8004475235939026
0 references
