Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334)
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 and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm |
scientific article; zbMATH DE number 6650410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm |
scientific article; zbMATH DE number 6650410 |
Statements
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (English)
0 references
10 November 2016
0 references
flowshop scheduling
0 references
bi-objective
0 references
makespan
0 references
total flowtime
0 references
0 references
0 references
0 references
0.8912315964698792
0 references
0.8854010701179504
0 references
0.8109913468360901
0 references
0.808302104473114
0 references
0.8077622652053833
0 references
