Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints

Automatic design of stochastic local search algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system uses a configuration tool to combine...

Celý popis

Podrobná bibliografie

Vydáno v:	Operations Research Perspectives Ročník 8; s. 1 - 17
Hlavní autoři:	Pagnozzi, Federico, Stützle, Thomas G
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier 2021 Elsevier Ltd
Témata:	Automatic algorithm design Combinatorial optimization No-idle Permutation flowshop problem Sequence dependent setup times Stochastic local search algorithms Sequence dependent setup times Permutation flowshop problem Stochastic local search algorithms No-idle Combinatorial optimization Automatic algorithm design
ISSN:	2214-7160, 2214-7160
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!