Given a discrete approximation to the service time distribution, we characterize the optimal
trade-o between execution time and resource usage for the case of scheduling a single task. We
show the optimal scheduling policy is in a set of nite size. We also present a low-complexity
heuristic algorithm to choose the scheduling policy that is close to optimal. Further, we give
insights into extending this analysis to the multi-task case.