Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem

2011 ◽  
Vol 24 (1) ◽  
pp. 102-112 ◽  
Author(s):  
Celia Gutiérrez ◽  
Iván García-Magariño
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Modular Design ◽  
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.

scholarly journals Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm

IEEE Access ◽  
2015 ◽  
Vol 3 ◽  
pp. 1740-1754 ◽  
Author(s):  
Hao-Chin Chang ◽  
Yeh-Peng Chen ◽  
Tung-Kuan Liu ◽  
Jyh-Horng Chou
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document