论文信息 - Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

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.

Parinya Kaweegitbundit

[1] M. Gholami,et al. Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[2] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[3] Chuen-Lung Chen,et al. An application of genetic algorithms for flow shop problems , 1995 .

[4] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[5] Poonam Garg,et al. A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm , 2010, ArXiv.