collaborators

1 paper

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…