b'@techreport{JansenPorkolab98-1-025,'b'\nTITLE = {Linear-time approximation schemes for scheduling malleable parallel tasks},\nAUTHOR = {Jansen, Klaus and Porkolab, Lorant},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1998-1-025},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1998},\nDATE = {1998},\nABSTRACT = {A malleable parallel task is one whose execution time is a function of the number of (identical) processors alloted to it. We study the problem of scheduling a set of $n$ independent malleable tasks on a fixed number of parallel processors, and propose an approximation scheme that for any fixed $\\epsilon > 0$, computes in $O(n)$ time a non-preemptive schedule of length at most $(1+\\epsilon)$ times the optimum.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'