Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2011.08.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2011.08.009 / rank | |||
Normal rank | |||
Latest revision as of 14:41, 9 December 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
0 references
0 references
0 references
