PT Unknown AU Jansen, K Trystram, D TI Scheduling Parallel Jobs on a Network of Heterogeneous Platforms SE Bericht des Instituts für Informatik PY 1992 VL 1502 PU Institut für Informatik WP https://macau.uni-kiel.de/receive/macau_mods_00002007 LA en SN 2192-6247 AB We consider the problem of scheduling parallel jobs on a network of heterogeneous platforms. Given a set J of n jobs where each job j 2 J is described by a pair (pj ; qj) with a processing time pj and number qj of processors required and a set of N heterogeneous platforms Pi with mi processors, the goal is to and a schedule for all jobs on the platforms minimizing the maximum completion time. Unless P = NP there is no approximation algorithm with absolute ratio better than 2 for the problem. We propose an approximation algorithm with absolute ratio 2 improving the previously best known algorithms. This closes the gap between the lower bound of 2 and the best approximation ratio. PI Kiel ER