Paper Info
Title
A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents
Abstract
HFSP with two agents and its minimality mode are considered and a novel SFLA is proposed.Tournament selection is applied to divide population.Not all solutions of population are allocated into memeplexes.The best solution of each memeplex acts as the object of the search process.The search process consists of the global searches and multiple neighborhood search. Two-agent scheduling problem has attracted much attention; however, two-agent hybrid flow shop scheduling problem (TAHFSP) is seldom studied. In this study, TAHFSP and its minimality model are considered and a novel shuffled frog-leaping algorithm (SFLA) is proposed is to minimize the sum of the objectives of two agents. The following new principles are applied in SFLA: a tournament selection based method is used to divide population, not all solutions of population are allocated into memeplexes, the best solution of each memeplex acts as the object of the search process and the search process within memeplex consists of the global searches on two sub-problems sequentially and multiple neighborhood search. We test the performance of SFLA using a number of instances and the experimental results show the notable advantage of our SFLA when compared to other algorithms of TAHFSP.
Year
DOI
Venue
2015
10.1016/j.eswa.2015.08.025
Expert Systems with Applications
Keywords
Field
DocType
Hybrid flow shop scheduling,Shuffled frog-leaping algorithm,Minimality model,Two agents
Population,Mathematical optimization,Job shop scheduling,Computer science,Flow shop scheduling,Neighborhood search,Tournament selection,Shuffled frog leaping algorithm
Journal
Volume
Issue
ISSN
42
23
0957-4174
Citations 
PageRank 
References 
7
0.48
18
Authors
2
Name
Order
Citations
PageRank
De-ming Lei117618.60
Xiuping Guo2272.35