The presentation will be in French.
The graphs have been used in scheduling since the sixties, they allow to model different practical situations (constraints): precedence, conflict, exclusion, concordance, compatibility, etc. The developed algorithms use the structure of the graph to schedule the jobs of the problem, so they are algorithms combining both the notions and the techniques used in graph theory and those of the theory of scheduling. In this presentation, we present some classical results, recent developments in this area and the challenges.
Welcome to everyone!