https://hal-univ-tours.archives-ouvertes.fr/hal-01003801Elvikis, DonatasDonatasElvikisUniversity of Kaiserslautern [Kaiserslautern]Hamacher, HorstHorstHamacherUniversity of Kaiserslautern [Kaiserslautern]t'Kindt, VincentVincentt'KindtROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002 - LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours - UT - Université de Tours - INSA CVL - Institut National des Sciences Appliquées - Centre Val de Loire - INSA - Institut National des Sciences Appliquées - CNRS - Centre National de la Recherche Scientifique - CNRS - Centre National de la Recherche ScientifiqueScheduling two interfering job sets on uniform parallel machines with makespan and cost functionsHAL CCSD2011Parallel machinesMuti-agent problemsBicriteria schedulingPareto optimum[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]T'Kindt, Vincent2014-06-10 16:50:442023-03-24 14:52:582014-06-10 16:50:44enJournal articles10.1007/s10951-010-0201-11We consider the problem of scheduling two jobs A and B on a set of m uniform parallel machines. Each job is assumed to be independent from the other: job A and job B are made up of n_A and n_B operations, respectively. Each operation is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size operations, i.e. all operations have the same processing time. The scheduling of operations of job A must be achieved to minimize a general cost function F_A , whereas it is the makespan that must be minimized when scheduling the operations of job B. These kind of problems are called multiple agent scheduling prob- lems. 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. In this paper we consider different min-max and min-sum versions of function F_A and provide special properties as well as polynomial time algorithms.