A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times

2020 ◽  
Author(s):  
Shuaipeng Yuan ◽  
Tieke Li ◽  
Bailin Wang
Keyword(s):  
Differential Evolution ◽  
Flow Shop ◽  
Differential Evolution Algorithm ◽  
Group Scheduling ◽  
Scheduling Problem ◽  
Sequence Dependent ◽  
Evolution Algorithm ◽  
Sequence Dependent Setup ◽  
Transportation Times ◽  
Discrete Differential Evolution

Optimization of Flow Shop Scheduling Problem Using Differential Evolution and Variable Neighborhood Search

2012 ◽  
Vol 590 ◽  
pp. 540-544
Author(s):  
Yan Ping Zhou
Keyword(s):  
Differential Evolution ◽  
Flow Shop ◽  
Differential Evolution Algorithm ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Variable Neighbourhood Search ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Neighbourhood Search ◽  
Evolution Algorithm

This paper proposed a new differential evolution algorithm based on variable neighbourhood search which is called as VNSDE. In VNSDE, the operation of variable neighbourhood search is performed after three basic operations of differential evolution, which can enhance the global search and improve the convergence. VNSDE is applied for solving flow shop scheduling problem with the makespan criterion. Computational experiment is performed over a typical FSSP benchmark using VNSDE, GA and DE, and result shows that VNSDE has higher performance than GA and DE.

Sign in / Sign up

Export Citation Format

Share Document