caa a22 4500 445838809 CHVBK 20180317145337.0 cr unu---uuuuu 170323e20111001xx s 000 0 eng 10.1007/s10951-010-0201-1 doi (NATIONALLICENCE)springer-10.1007/s10951-010-0201-1 Scheduling two agents on uniform parallel machines withmakespan and cost functions [Elektronische Daten] [Donatas Elvikis, Horst Hamacher, Vincent T'kindt] We 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 problems. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F A and $C_{\mathrm{max}}^{B}$ 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. Springer Science+Business Media, LLC, 2010 Parallel machines nationallicence Muti-agent problems nationallicence Bicriteria scheduling nationallicence Pareto optimum nationallicence Elvikis Donatas University of Kaiserslautern, Kaiserslautern, Germany aut Hamacher Horst University of Kaiserslautern, Kaiserslautern, Germany aut T'kindt Vincent LI, Université François Rabelais de Tours, Tours, France aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 471-481 1094-6136 14:5<471 2011 14 10951 https://doi.org/10.1007/s10951-010-0201-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-010-0201-1 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Elvikis Donatas University of Kaiserslautern, Kaiserslautern, Germany aut NATIONALLICENCE 700 1- Hamacher Horst University of Kaiserslautern, Kaiserslautern, Germany aut NATIONALLICENCE 700 1- T'kindt Vincent LI, Université François Rabelais de Tours, Tours, France aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 471-481 1094-6136 14:5<471 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer