An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem

•We study a distributed assembly permutation flowshop scheduling problem.•We propose an improved iterative greedy algorithm based on group thinking.•A destruction-construction is designed for products and jobs separately.•A selection method based on the objective values and ages are used.•The effect...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & industrial engineering Ročník 152; s. 107021
Hlavní autoři:	Huang, Ying-Ying, Pan, Quan-Ke, Huang, Jiang-Ping, Suganthan, PN, Gao, Liang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.02.2021
Témata:	Distributed assembly permutation flowshop scheduling Heuristic Iterated greedy algorithm Local search Total flowtime Local search Iterated greedy algorithm Distributed assembly permutation flowshop scheduling Total flowtime Heuristic
ISSN:	0360-8352, 1879-0550
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!