Fixed interval scheduling problems with energy constraints

Session : GTSS1 / GTSS1 : Exact methods for scheduling problems
Mercredi 10 février 15:00 - 15:40 Salle : CI2-04
Ammar Oulamara et Ons Sassi

In this paper, we consider a new problem of Interval Scheduling with Energy Constraints. In this paper we are interested in three types of problems: (i) Which is the minimum number of machines required to schedule all jobs, (ii) What is the maximum number of jobs that could be scheduled, (iii) Which is the subset of jobs that can be scheduled with the maximum total weight. Our objective is to study the complexity and the approximability of those different types of problems.

Mots clés : Interval scheduling, complexity, approximation