A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

Authors:
Maurice Queyranne;Maxim Sviridenko
Affiliations:
Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, BC, Canada;IBM T.J. Watson Research Center, PO Box 218, Yorktown Heights, NY
Venue:
Journal of Algorithms
Year:
2002

Citing 8
Cited 8

Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Improved approximation algorthims for scheduling with release dates

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
New and improved algorithms for minsum shop scheduling

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

Discrete Applied Mathematics
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Improved Scheduling Algorithms for Minsum Criteria

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Random-Based Scheduling: New Approximations and LP Lower Bounds

RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science

Improved results for data migration and open shop scheduling

ACM Transactions on Algorithms (TALG)
Improved bounds for scheduling conflicting jobs with minsum criteria

ACM Transactions on Algorithms (TALG)
Approximability of Average Completion Time Scheduling on Unrelated Machines

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Sum edge coloring of multigraphs via configuration LP

ACM Transactions on Algorithms (TALG)
Properties of optimal schedules in preemptive shop scheduling

Discrete Applied Mathematics
On a local protocol for concurrent file transfers

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Combinatorial algorithms for data migration to minimize average completion time

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective. The main result is a (2 + ε)- approximation algorithm for this problem. In the last section we also discuss the possibility of improving our algorithm.