activity
20162019
most citedApproximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints

14 citations · 17 across the 7 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.DS2018

An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines

Gais Alhadi, Imed Kacem, Pierre Laroche +1

We consider the two-parallel machines scheduling problem, with the aim of minimizing the maximum lateness and the makespan. Formally, the problem is defined as follows. We have to…