Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179)
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 6938904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast heuristics for minimizing the makespan in non-permutation flow shops |
scientific article; zbMATH DE number 6938904 |
Statements
Fast heuristics for minimizing the makespan in non-permutation flow shops (English)
0 references
18 September 2018
0 references
scheduling
0 references
metaheuristics
0 references
flow shop
0 references
non-permutation schedules
0 references
makespan
0 references
iterated greedy algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.918703019618988
0 references
0.8507649302482605
0 references
0.8400757312774658
0 references
0.8379892110824585
0 references
