Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
Online scheduling of pick-up and delivery tasks in hospitals
Journal of Biomedical Informatics
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A priori parallel machines scheduling
Computers and Industrial Engineering
Lower bounds for smith's rule in stochastic machine scheduling
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
| Hi-index | 0.00 |
We consider the problem of scheduling a set ofn jobs onm identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the strong sense. The best approximation result known so far was a 1/2 (1 + 2)-approximation algorithm that has been derived by Kawaguchi and Kyan back in 1986. The contribution of this paper is a polynomial time approximation scheme for this setting, which settles a problem that was open for a long time. Moreover, our result constitutes the =rst known approximation scheme for a strongly NP-hard scheduling problem with minsum objective.