Multi-objective parallel machine scheduling with incompatible jobs

Simon Thevenin (1) , Nicolas Zufferey (2) , Jean-Yves Potvin (3)

1 University of Geneva
2 UNIGE - Université de Genève = University of Geneva
3 UdeM - Université de Montréal

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.

Mots clés: Scheduling; incompatibilities; preemption; multicoloring

Domaines: Recherche opérationnelle [math.OC]

Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin. Multi-objective parallel machine scheduling with incompatible jobs. ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France. ⟨hal-00946503⟩