Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2024

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

Résumé

We consider a multiobjective scheduling problem, with the aim of minimizing the maximum lateness and the makespan on identical machines, when the number of machines is fixed. This paper proposes an exact algorithm (based on a dynamic programming) to generate the complete Pareto Frontier in a pseudo-polynomial time. Moreover, four heuristics have been proposed in order to optimize our algorithm. Then, we present a Polynomial Time Approximation Scheme (PTAS) to generate an approximate Pareto Frontier. In this scheme, we use a simplification technique based on the merging of jobs. Furthermore, we present a Fully Polynomial Time Approximation Scheme (FPTAS) to generate an approximate Pareto Frontier, based on the conversion of the dynamic programming algorithm. The proposed FPTAS is strongly polynomial. Finally, some numerical experiments are provided in order to compare the proposed approaches.
Fichier non déposé

Dates et versions

hal-04464514 , version 1 (18-02-2024)

Identifiants

Citer

Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin Osman. Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. RAIRO - Operations Research, 2024, ⟨10.1051/ro/2024029⟩. ⟨hal-04464514⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More