Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177)
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: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops |
scientific article; zbMATH DE number 6654091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops |
scientific article; zbMATH DE number 6654091 |
Statements
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (English)
0 references
17 November 2016
0 references
scheduling
0 references
metaheuristics
0 references
flow shop
0 references
non-permutation schedules
0 references
0 references
0 references
0 references
0 references
0 references
0.918703019618988
0 references
0.8778039216995239
0 references
0.8371546268463135
0 references
0.8360579609870911
0 references
