Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoDIT, 2018)

An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoRR, 2018)

Polynomial Approximation Algorithms for Parallel Machine Problems in a Multi-objective or Constrained Context. (Algorithmes d'approximation polynomiale pour des problèmes d'ordonnancement sur machines parallèles dans un contexte multi-objectif ou contraint). - Gais Alhadi (2019)

Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (Ann. Oper. Res., 2020)

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (RAIRO Oper. Res., 2024)