Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Zhijiu Ai, Xiaodong Zhang, Yun-Hae Kim and Prasad Yarlagadda

Pages:

332-335

DOI:

10.4028/www.scientific.net/AMR.339.332

Citation:

P. Kaweegitbundit "Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time", Advanced Materials Research, Vol. 339, pp. 332-335, 2011

Online since:

September 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.