@Misc{macau_mods_00002007, author = {Jansen, Klaus and Trystram, Denis}, title = {Scheduling Parallel Jobs on a Network of Heterogeneous Platforms}, year = {1992}, publisher = {Institut f{\"u}r Informatik}, address = {Kiel}, volume = {1502}, abstract = {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.}, issn = {2192-6247}, url = {https://macau.uni-kiel.de/receive/macau_mods_00002007}, file = {:https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00003065/tr-1502.pdf:PDF}, language = {en} }