Genetic algorithms for the flow shop scheduling problem with availability constraints

2002 ◽  
Author(s):  
R. Aggoune ◽  
A.H. Mahdi ◽  
M.-C. Portmann
Keyword(s):  
Genetic Algorithms ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Availability Constraints

scholarly journals An Improved Genetic Algorithms for Multi-objective Hybrid Flow-shop Scheduling Problem

2019 ◽  
Vol 95 ◽  
pp. 03008
Author(s):  
Zhao Zijin ◽  
Wang aimin ◽  
Ge Yan ◽  
Lin Lin
Keyword(s):  
Genetic Algorithms ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Production Cycle ◽  
Local Optimum ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Multi Objective ◽  
Hybrid Flow Shop Scheduling

To deal with the multi-objective hybrid flow Shop Scheduling Problem (HFSP), an improved genetic algorithms based on parallel sequential moving and variable mutation rate is proposed. Compared with the traditional GA, the algorithm proposed in this paper uses the two-point mutation rule based on VMR to find the global optimum which can make the algorithm jump out of the local optimum as far as possible, once it falls into the local optimum quickly. Decoding rules based on parallel sequential movement ensures that the artifact can start processing in time, so that the buffer between stages in the flow-shop is as little as possible, and the production cycle is shortened. Finally, a program was developed with the actual data of a workshop to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

Sign in / Sign up

Export Citation Format

Share Document