SIAM Journal on Discrete Mathematics
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM)
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Moderately exponential approximation for makespan minimization on related machines
Theoretical Computer Science
Hi-index | 0.00 |
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in the number n of jobs, and the multiplicative constant hidden in the O(n) running time is reasonably small and independent of the error ε.