scheduling problem ? Several agents have to share the same resources, each of witch is associated with one sub-set of jobs and aims at minimizing some objective function If N is the whole set of the jobs, then each agent k is associated with (f k, Nk) The scenarios defined in the literature: competing, interfering, non-disjoint, symmetric Problems studied: competing agent + global agent (N 2, f 2) (N 1, f 1) (N , f GA) Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 4 / 10