A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems
2018
2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
There have been extensive works dealing with genetic algorithms (GAs) for seeking optimal solutions of shop scheduling problems. Due to the NP hardness, the time cost is always heavy. With the development of high performance computing (HPC) in last decades, the interest has been focused on parallel GAs for shop scheduling problems. In this paper, we present the state of the art with respect to the recent works on solving shop scheduling problems using parallel GAs. It showcases the most
doi:10.1109/ipdpsw.2018.00103
dblp:conf/ipps/LuoB18
fatcat:kabw5jzsjrf7lfv4kvknc7z4q4