An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance

•We study a distributed flowshop problem with preventive maintenance.•We present a novel multi-start iterated greedy algorithm.•An improved NEH with dropout is proposed to generate searching starting-point.•A destruction with the tournament selection is well designed.•The effective of the iterated g...

Celý popis

Podrobná bibliografie

Vydáno v:	Expert systems with applications Ročník 169; s. 114495
Hlavní autoři:	Mao, Jia-yang, Pan, Quan-ke, Miao, Zhong-hua, Gao, Liang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.05.2021 Elsevier BV
Témata:	Distributed permutation flowshop scheduling problem Greedy algorithms Heuristic methods Iterated greedy algorithm Job shops Makespan Permutations Preventive maintenance Scheduling Iterated greedy algorithm Makespan Distributed permutation flowshop scheduling problem Heuristic methods Preventive maintenance
ISSN:	0957-4174, 1873-6793
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!