A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855)
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 6872961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation |
scientific article; zbMATH DE number 6872961 |
Statements
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (English)
0 references
24 May 2018
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
metaheuristics
0 references
computational evaluation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8973046
0 references
0.89178985
0 references
0.8881691
0 references
0 references
0.88745564
0 references
0.88627726
0 references
0.88289094
0 references
0.88276184
0 references
0.8822744
0 references
