An approximation algorithm for scheduling two parallel machines with capacity constraints

Authors:
Heng Yang;Yinyu Ye;Jiawei Zhang
Affiliations:
State Key Laboratory of Intelligent Technology and System, Department of Automation, Tsinghua University, Beijing 100084, People's Republic of China;Department of Management Science and Engineering, School of Engineering, Stanford University, Stanford, CA;Department of Management Science and Engineering, School of Engineering, Stanford University, Stanford, CA
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 10
Cited 3

Asymptotic analysis of an algorithm for balanced parallel processor scheduling

SIAM Journal on Computing
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Approximation algorithms for scheduling

Approximation algorithms for NP-hard problems
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
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
Algorithmic derandomization via complexity theory

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Derandomizing semidefinite programming based approximation algorithms

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Semidefinite Relaxations for Parallel Machine Scheduling

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Approximating Scheduling Machines with Capacity Constraints

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Generalized machine activation problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Note: A comment on scheduling two parallel machines with capacity constraints

Discrete Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semidefinite programming-based approximation algorithm for solving this problem and prove that the algorithm has a worst case ratio at most 1.1626.