Worst case bound of an LRF schedule for the mean weighted flow-time problem
SIAM Journal on Computing
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Randomized algorithms
Randomized approximation algorithms in combinatorial optimization
Approximation algorithms for NP-hard problems
Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal scheduling of multiclass parallel machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
Mathematics of Operations Research
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Scheduling Unrelated Machines by Randomized Rounding
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
On Dependent Randomized Rounding Algorithms
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Journal of Computer and System Sciences - STOC 2001
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Approximability of Average Completion Time Scheduling on Unrelated Machines
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
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
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
SIAM Journal on Matrix Analysis and Applications
Concentration inequalities for nonlinear matroid intersection
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
An approximate algorithm for a high-multiplicity parallel machine scheduling problem
Operations Research Letters
A study of the quadratic semi-assignment polytope
Discrete Optimization
A 32-approximation algorithm for parallel machine scheduling with controllable processing times
Operations Research Letters
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a provably good convex quadratic programming relaxation of strongly polynomial size for this problem. The best previously known approximation algorithms are based on LP relaxations in time- or interval-indexed variables. Those LP relaxations, however, suffer from a huge number of variables. As a result of the convex quadratic programming approach we can give a very simple and easy to analyze 2-approximation algorithm which can be further improved to performance guarantee 3/2 in the absence of release dates. We also consider preemptive scheduling problems and derive approximation algorithms and results on the power of preemption which improve upon the best previously known results for these settings. Finally, for the special case of two machines we introduce a more sophisticated semidefinite programming relaxation and apply the random hyperplane technique introduced by Goemans and Williamson for the MaxCut problem; this leads to an improved 1.2752-approximation.