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

Abstract

International audience 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