The effort of searching an optimal solution for scheduling problems is important for real-world industrial applications especially for mission-time critical systems. In this paper, a parallel GA is employed to solve flow shop scheduling problems to minimize the makespan.According to our experimental results, the proposed parallel genetic algorithm (PPGA) considerably decreases the CPU time without adversely affecting the makespan.
No takes yet. Share an insight, caveat, or question.
Akhshabi et al. (2012) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: