Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
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.
scheduling hybrid assembly-differentiation flowshop total flow time hybrid meta-heuristics