| Article ID: | iaor20032771 |
| Country: | United States |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 507 |
| End Page Number: | 520 |
| Publication Date: | Mar 2002 |
| Journal: | Algorithmica |
| Authors: | Jansen K., Porkolab L. |
A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted 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 ε > 0, computes in