An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

The distributed permutation flowshop scheduling problem (DPFSP) has attracted much attention in recent years. In this paper, we extend the DPFSP by considering the sequence-dependent setup time (SDST), and present a mathematical model and an iterated greedy algorithm with a restart scheme (IGR). In...

Celý popis

Podrobná bibliografia

Vydané v:	Swarm and evolutionary computation Ročník 59; s. 100742
Hlavní autori:	Huang, Jiang-Ping, Pan, Quan-Ke, Gao, Liang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.12.2020
Predmet:	Flowshop Iterated greedy algorithm Meta-heuristics Scheduling Iterated greedy algorithm Scheduling Flowshop Meta-heuristics
ISSN:	2210-6502
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!