Paper Info
Title
Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks
Abstract
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.
Year
DOI
Venue
2020
10.1016/j.engappai.2020.103540
Engineering Applications of Artificial Intelligence
Keywords
DocType
Volume
Distributed scheduling,Hybrid flow shop scheduling,Multiprocessor tasks,Shuffled frog-leaping algorithm,Dynamic strategy
Journal
90
Issue
ISSN
Citations 
C
0952-1976
5
PageRank 
References 
Authors
0.38
0
3
Name
Order
Citations
PageRank
Jingcao Cai1123.15
Rui Zhou22117.94
De-ming Lei317618.60