Multi-objective scheduling on two dedicated processors
-
Adel Kacem [1] ; Abdelaziz Dammak [1]
-
[1] University of Sfax
University of Sfax
Túnez
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 29, Nº. 3, 2021, págs. 694-721
- Idioma: inglés
- DOI: 10.1007/s11750-020-00588-5
- Enlaces
-
Resumen
We study a multi-objective scheduling problem on two dedicated processors. The aim is to minimize simultaneously the makespan, the total tardiness and the total completion time. This NP-hard problem requires the use of well-adapted methods. For this, we adapted genetic algorithms to multi-objective case. Four methods are presented to solve this problem. The first is an aggregative genetic algorithm (GA), the second is a Pareto GA, the third is a non-dominated sorting GA (NSGA-II) and the fourth is a constructive algorithm based on lower bounds (CABLB). We proposed some adapted lower bounds for each criterion to evaluate the quality of the found results on a large set of instances. Indeed, these bounds also make it possible to determine the dominance of one algorithm over another based on the different results found by each of them. We used two metrics to measure the quality of the Pareto front: the hypervolume indicator (HV) and the number of solutions in the Pareto front (ND). The obtained results show the effectiveness of the proposed algorithms.
