Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions

Donatas Elvikis (1) , Horst Hamacher (1) , Vincent t'Kindt (2)

1 University of Kaiserslautern [Kaiserslautern]
2 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours

 We consider a m uniform parallel machines scheduling problem with two jobs A and B with n A and n B operations, respectively, and equal processing times. Job A is associated with a general cost function F A , whereas makespan is considered for job B. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F A and C B max criteria. We also tackle some particular cases of F A and provide polynomial algorithms.

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Donatas Elvikis, Horst Hamacher, Vincent t'Kindt. Scheduling two interfering job sets on uniform parallel machines with makespan and cost functions. 4th Multidisciplinary International Conference on Scheduling: Theory and Applications, Aug 2009, Dublin, Ireland. ⟨hal-01025652⟩