Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution

2008 ◽  
Vol 13 (8-9) ◽  
pp. 847-869 ◽  
Author(s):  
Bin Qian ◽  
Ling Wang ◽  
De-Xian Huang ◽  
Xiong Wang
Keyword(s):  
Differential Evolution ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Multi Objective ◽  
No Wait

scholarly journals A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability

2017 ◽  
Vol 10 (12) ◽  
pp. 197
Author(s):  
Mohammad Rahmanidoust
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Evolutionary Strategy ◽  
Optimization Approach ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Multi Objective ◽  
No Wait ◽  
Two Stages ◽  
Flexible Flow Shop Scheduling

The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.

Sign in / Sign up

Export Citation Format

Share Document