Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6650410 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flowshop scheduling | |||
| Property / zbMATH Keywords: flowshop scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bi-objective | |||
| Property / zbMATH Keywords: bi-objective / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
makespan | |||
| Property / zbMATH Keywords: makespan / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
total flowtime | |||
| Property / zbMATH Keywords: total flowtime / rank | |||
Normal rank | |||
Revision as of 05:13, 28 June 2023
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
