Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints

2020 ◽  
Vol 285 (3) ◽  
pp. 955-964 ◽  
Author(s):  
Leonardo Cabral R. Soares ◽  
Marco Antonio M. Carvalho
2017 ◽  
Vol 257 (3) ◽  
pp. 834-844 ◽  
Author(s):  
Andreza Cristina Beezão ◽  
Jean-François Cordeau ◽  
Gilbert Laporte ◽  
Horacio Hideki Yanasse

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


Sign in / Sign up

Export Citation Format

Share Document