Paper Info
Title
Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time.
Abstract
•Hybrid assembly-differentiation flowshop scheduling problem with total flow time.•A mixed integer programming model for the HADFSP-TFT.•Some properties of the optimal solutions for the HADFSP-TFT.•Two fast heuristics and three hybrid meta-heuristics for the HADFSP-TFT.•A lower bound for the HADFSP-TFT to evaluate the proposed algorithms.
Year
DOI
Venue
2015
10.1016/j.ejor.2014.07.004
European Journal of Operational Research
Keywords
Field
DocType
Scheduling,Hybrid assembly-differentiation flowshop,Hybrid meta-heuristics,Total flow time
Mathematical optimization,Heuristic,Job shop scheduling,Scheduling (computing),Upper and lower bounds,Flow time,Heuristics,Integer programming,Mathematics,Operations management,Computational analysis
Journal
Volume
Issue
ISSN
240
2
0377-2217
Citations 
PageRank 
References 
7
0.42
31
Authors
3
Name
Order
Citations
PageRank
Fuli Xiong1352.60
Keyi Xing252234.59
Feng Wang3261.38