Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (Q473611): Difference between revisions

Summary: We consider the NP-hard problem of minimizing makespan for \(n\) jobs on \(m\) unrelated parallel machines with release dates in this research. A heuristic and a very effective particle swarm optimization (PSO) algorithm have been proposed to tackle the problem. Two lower bounds have been proposed to serve as a basis for comparison for large problem instances. Computational results show that the proposed PSO is very accurate and that it outperforms the existing metaheuristic.