Title
Two-phase neighborhood search algorithm for two-agent hybrid flow shop scheduling problem.
Abstract
•Two-agent hybrid flow shop scheduling problem is first considered.•The feasibility model is considered unlike most of literature on multi-agent scheduling.•A two-phase neighborhood search is proposed, which is composed of VNS and ILS.•Two variable neighborhood mechanism and an effective perturbation are used.•Computational results show the promising advantage of the proposed algorithm.
Year
DOI
Venue
2015
10.1016/j.asoc.2015.05.027
Applied Soft Computing
Keywords
Field
DocType
Hybrid flow shop scheduling,Feasibility model,Two-phase neighborhood search
Mathematical optimization,Flow shop scheduling,Algorithm,Neighborhood search,Mathematics
Journal
Volume
ISSN
Citations 
34
1568-4946
5
PageRank 
References 
Authors
0.43
23
1
Name
Order
Citations
PageRank
De-ming Lei117618.60