An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem

2016 ◽  
Vol 174 ◽  
pp. 93-110 ◽  
Author(s):  
Xinyu Li ◽  
Liang Gao
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

A Hybrid Genetic Algorithm for Flexible Job-Shop Scheduling Problem

2014 ◽  
Vol 889-890 ◽  
pp. 1179-1184 ◽  
Author(s):  
Shuang Xi Wang ◽  
Chao Yong Zhang ◽  
Liang Liang Jin
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

In this paper, a hybrid genetic algorithm is presented for the flexible job-shop scheduling problem with makespan criterion. A new machine assignment strategy is proposed to improve the initial population. A modified coding scheme is presented, and a population improvement strategy is performed when the best solution of the population did not improve during some generations. This hybrid algorithm is tested on a series of benchmarks instances. Experimental results show that this hybrid algorithm is efficient and competitive compared to some existing methods.

Sign in / Sign up

Export Citation Format

Share Document