Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458)
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 permutation flow shop scheduling problems using a hybrid metaheuristic algorithm |
scientific article; zbMATH DE number 5377417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm |
scientific article; zbMATH DE number 5377417 |
Statements
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (English)
0 references
4 December 2008
0 references
production scheduling
0 references
permutation flow shop
0 references
variable neighbourhood search
0 references
0 references
0 references
0 references
0 references
0 references
0.8099648952484131
0 references
0.7949963808059692
0 references
0.7920988202095032
0 references
0.7919931411743164
0 references
