Sequential and Parallel Genetic Algorithms for the Hybrid Flow Shop Scheduling Problem

2006 ◽  
Vol 6 (4) ◽  
pp. 775-778 ◽  
Author(s):  
K. Belkadi ◽  
M. Gourgand . ◽  
M. Benyettou . ◽  
A. Aribi .
2019 ◽  
Vol 95 ◽  
pp. 03008
Author(s):  
Zhao Zijin ◽  
Wang aimin ◽  
Ge Yan ◽  
Lin Lin

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.


2012 ◽  
Vol 252 ◽  
pp. 354-359
Author(s):  
Xin Min Zhang ◽  
Meng Yue Zhang

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.


Sign in / Sign up

Export Citation Format

Share Document