Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time
This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.
Zhijiu Ai, Xiaodong Zhang, Yun-Hae Kim and Prasad Yarlagadda
P. Kaweegitbundit "Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time", Advanced Materials Research, Vol. 339, pp. 332-335, 2011