Predator-Prey Techniques for Solving Multiobjective Scheduling Problems for Unrelated Parallel Machines

摘要

The multiobjective scheduling problem on unrelated parallel machines is tackled by predator-prey techniques. Several objectives adopted in the literature were considered and the corresponding best aligned dispatch rules were associated with the predators. Also, we suggest and analyse modifications in the movement operator, in the number of predators, and in the influence of the objectives in the selection/replacement procedures. Numerical comparisons with the popular NSGA-II were performed and good results were obtained by the predator-prey techniques.