Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:36, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm |
scientific article |
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
