Program > By speacker > Thevenin Simon

Wednesday 26
Young researcher contest
Luce Brotcorne
› 12:00 - 12:30 (30min)
› Bât. C - TD 41
Multi-objective parallel machine scheduling with incompatible jobs
Simon Thevenin  1@  , Nicolas Zufferey  1@  , Jean-Yves Potvin  2@  
1 : University of Geneva  -  Website
2 : Département d'Informatique et de Recherche Opérationnelle [Montreal]  (DIRO)  -  Website
Département d'Informatique et de recherche opérationnelle Université de Montréal Pavillon André-Aisenstadt CP 6128 succ Centre-Ville Montréal QC H3C 3J7 Canada -  Canada

We consider the problem of scheduling n jobs with different processing times on parallel identical machines with job incompatibility constraints and preemption possibility.
Three objectives have to be minimized in lexicographical (or hierarchical) order: makespan, number of job interruptions, and sum of throughput times over all jobs. A linear programming formulation, a greedy heuristic and a tabu search are proposed to solve this problem.

Online user: 4