No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms

2013 ◽  
Vol 25 (2) ◽  
pp. 207-225 ◽  
Author(s):  
Nazanin Moradinasab ◽  
Rasoul Shafaei ◽  
Meysam Rabiee ◽  
Pezhman Ramezani
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Two Stage ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
No Wait ◽  
Competitive Algorithms

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