Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks

Distributed scheduling problems have attracted much attention in recent years; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated. In this paper, DHFSP with multiprocessor tasks is studied and a dynamic shuffled frog-leaping algorithm (DSFLA) is proposed to minim...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering applications of artificial intelligence Ročník 90; s. 103540
Hlavní autoři: Cai, Jingcao, Zhou, Rui, Lei, Deming
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.04.2020
Témata:
Distributed scheduling
Dynamic strategy
Hybrid flow shop scheduling
Multiprocessor tasks
Shuffled frog-leaping algorithm
Distributed scheduling
Shuffled frog-leaping algorithm
Multiprocessor tasks
Hybrid flow shop scheduling
Dynamic strategy
ISSN:0952-1976, 1873-6769
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!
Popis
Shrnutí:Distributed scheduling problems have attracted much attention in recent years; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated. In this paper, DHFSP with multiprocessor tasks is studied and a dynamic shuffled frog-leaping algorithm (DSFLA) is proposed to minimize makespan. Dynamic search process is executed in each memeplex with at least two improved solutions. Global search and dynamic multiple neighborhood search are applied, in which neighborhood structure is chosen based on its optimization effect. A new destruction-construction process is hybridized with DSFLA and population shuffling is done when shuffling condition is met. Lower bound is obtained and proved. A number of experiments are conducted on a set of instances. The computational results validate the effectiveness of the new strategies of DSFLA and the competitive performances on solving the considered DHFSP. •Distributed hybrid flow shop scheduling with multiprocessor tasks is studied.•A dynamic shuffled frog-leaping algorithm is proposed to minimize makespan.•Dynamic search process is executed in each memeplex.•A destruction-construction process in a memeplex is designed.•Lower bound is obtained.
ISSN:0952-1976
1873-6769
DOI:10.1016/j.engappai.2020.103540