An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem

2013 ◽  
Vol 47 (2/3) ◽  
pp. 280 ◽  
Author(s):  
Xiaojuan Wang ◽  
Wenfeng Li ◽  
Ying Zhang
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm

The Improved Genetic Algorithm for Multi-Objective Flexible Job Shop Scheduling Problem

2011 ◽  
Vol 66-68 ◽  
pp. 870-875 ◽  
Author(s):  
Jian Jun Yang ◽  
Lu Yan Ju ◽  
Bao Ye Liu
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Adaptive Mutation ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective

To solve the multi-objective flexible job shop scheduling problem, an improved non-dominated sorting genetic algorithm is proposed. Multi-objective mathematical model is established, four objectives, makespan, maximal workload, total workload and total tardiness are considered together. In this paper a dual coding method is employed, and infeasible solutions were avoided by new crossover and mutation methods. Pareto optimal set was taken to deal with multi-objective optimization problem, in order to reduce computational complexity, the non-dominated sorting method was improved. The niche technology is adopted to increase the diversity of solutions, and a new self adaptive mutation rate computing method is designed. The proposed algorithm is tested on some instances, and the computation results demonstrate the superiority of the algorithm.

A Novel Variable Neighborhood Genetic Algorithm for Multi-Objective Flexible Job-Shop Scheduling Problems

2010 ◽  
Vol 118-120 ◽  
pp. 369-373 ◽  
Author(s):  
Guo Hui Zhang ◽  
Liang Gao ◽  
Yang Shi
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. It is quite difficult to achieve optimal or near-optimal solutions with single traditional optimization approach because the multi objective FJSP has the high computational complexity. An novel hybrid algorithm combined variable neighborhood search algorithm with genetic algorithm is proposed to solve the multi objective FJSP in this paper. An external memory is adopted to save and update the non-dominated solutions during the optimization process. To evaluate the performance of the proposed hybrid algorithm, benchmark problems are solved. Computational results show that the proposed algorithm is efficient and effective approach for the multi objective FJSP.

Sign in / Sign up

Export Citation Format

Share Document