Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Mechanisms for discrete optimization with rational agents
Mechanisms for discrete optimization with rational agents
All-norm approximation algorithms
Journal of Algorithms
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Unrelated parallel machine scheduling with resource dependent processing times
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Operations Research Letters
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lpNorm
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A Lower Bound for the On-Line Preemptive Machine Scheduling with lpNorm
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Randomized Truthful Mechanisms for Scheduling Unrelated Machines
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Truthful mechanisms for two-range-values variant of unrelated scheduling
Theoretical Computer Science
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |
We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, makespan, and other well-studied objective functions. We obtain the following applications for the general setting of unrelated parallel machines: (i) a bicriteria algorithm for a schedule whose weighted completion-time and makespan simultaneously exhibit the current-best individual approximations for these criteria (3/2 and 2, respectively); (ii) better-than two approximation guarantees for scheduling under the Lp norm for all 1