Adaptive Genetic Algorithm for Hybrid Flow-Shop Scheduling

2013 ◽  
Vol 753-755 ◽  
pp. 2925-2929
Author(s):  
Xiao Chun Zhu ◽  
Jian Feng Zhao ◽  
Mu Lan Wang
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Adaptive Genetic Algorithm ◽  
Shop Scheduling ◽  
Mutation Operators ◽  
Hybrid Flow Shop Scheduling ◽  
Encoding Method ◽  
Crossover And Mutation

This paper studies the scheduling problem of Hybrid Flow Shop (HFS) under the objective of minimizing makespan. The corresponding scheduling simulation system is developed in details, which employed a new encoding method so as to guarantee the validity of chromosomes and the convenience of calculation. The corresponding crossover and mutation operators are proposed for optimum sequencing. The simulation results show that the adaptive Genetic Algorithm (GA) is an effective and efficient method for solving HFS Problems.

Hybrid Flow-Shop Scheduling Method and Simulation Based on Adaptive Genetic Algorithm

2014 ◽  
Vol 670-671 ◽  
pp. 1434-1438
Author(s):  
Jian Feng Zhao ◽  
Xiao Chun Zhu ◽  
Bao Sheng Wang
Keyword(s):  
Genetic Algorithm ◽  
Production Scheduling ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Adaptive Genetic Algorithm ◽  
Scheduling Problems ◽  
Mutation Operators ◽  
Hybrid Flow Shop Scheduling ◽  
Encoding Method

The n-job, k-stage hybrid flow shop problem is one of the general production scheduling problems. Hybrid flow shop (HFS) problems are NP-Hard when the objective is to minimize the makespan .The research deals with the criterion of makespan minimization for the HFS scheduling problems. In this paper we present a new encoding method so as to guarantee the validity of chromosomes and convenience of calculation and corresponding crossover and mutation operators are designed for optimum sequencing. The simulation results show that the Sequence Adaptive Cross Genetic Algorithm (SACGA) is an effective and efficient method for solving HFS Problems.

Optimization of Two-Stage Hybrid Flow Shop Scheduling Problems Using Genetic Algorithm

2015 ◽  
Vol 766-767 ◽  
pp. 962-967
Author(s):  
M. Saravanan ◽  
S. Sridhar ◽  
N. Harikannan
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Computational Time ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

The two-stage Hybrid flow shop (HFS) scheduling is characterized n jobs m machines with two-stages in series. The essential complexities of the problem need to solve the hybrid flow shop scheduling using meta-heuristics. The paper addresses two-stage hybrid flow shop scheduling problems to minimize the makespan time with the batch size of 100 using Genetic Algorithm (GA) and Simulated Annealing algorithm (SA). The computational results observed that the GA algorithm is finding out good quality solutions than SA with lesser computational time.

Sign in / Sign up

Export Citation Format

Share Document