A hybrid algorithm based on Tabu search for no-wait flow shop

Author

Hai-ying, QI ; Zhan-zhi, Qiu

Author_Institution

Coll. of Software, Dalian Jiaotong Univ., Dalian

fYear

2008

fDate

2-4 July 2008

Firstpage

1645

Lastpage

1648

Abstract

To the problem that it takes minimum makespan problem of no-wait flow shop scheduling, a hybrid algorithm based on tabu search is proposed. Scheduling rules is used to create the initial solution, Tabu search algorithm of varying neighborhood is applied to improve the last solution. The algorithm reduces the size of neighborhood and running time with reachability. Information of the unvisited candidate solutions is recollected, intensive search and dispersive search is reasonably balanced. Numerical experiments show that the algorithm is applicable and effective.

Keywords

flow shop scheduling; reachability analysis; search problems; dispersive search; intensive search; no-wait flow shop scheduling; reachability; scheduling rules; tabu search; Application software; Computational modeling; Convergence of numerical methods; Dispersion; Educational institutions; Electronic mail; Heuristic algorithms; Job shop scheduling; Operations research; Scheduling algorithm; intensive and dispersive search; no-wait flow shop; tabu search; varying neighborhood;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference, 2008. CCDC 2008. Chinese

Conference_Location

Yantai, Shandong

Print_ISBN

978-1-4244-1733-9

Electronic_ISBN

978-1-4244-1734-6

Type

conf

DOI

10.1109/CCDC.2008.4597598

Filename

4597598