An Efficient Hybrid Based on HS and GA Solving Blocking Flow Shop Scheduling Problems

Article Preview

Abstract:

This paper presents an efficient hybrid algorithms (EHA) based on harmony search (HS) algorithms and genetic algorithm (GA) for solving blocking flow shop scheduling problem. An improved GA is used to get better results. The computational result shows that EHA is not only better than GA , but also better than HS algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 479-481)

Pages:

1893-1896

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ronconi DP. International Journal of Production Economics (2004), p.39.

Google Scholar

[2] Geem ZW, Kim J-H, Loganathan GV. Simulations (2001), p.60.

Google Scholar

[3] QuanKe Pan, Ling Wang, M. Fatih Tasgetirenc. Hybrid Harmony Search Algorithms for Minimizing Makespan and Total flowtime in Blocking Flow Shop Scheduling Problems. Accepted by Computers and Industrial Engineering(2009).

DOI: 10.1016/j.eswa.2010.04.042

Google Scholar

[4] Ling Wang, Quan-Ke Pan, M.F. Tasgetiren, Expert Systems with Applications (2010).

Google Scholar

[5] Yun Bao, Hua Jiang, Liping Zheng. A Hybrid based GA And HS Algorithms in Blocking Flow Shop Scheduling Problems. The 2nd International Conference on Mechanic Automation and Control Engineering (2011), p.953.

DOI: 10.1109/mace.2011.5987089

Google Scholar