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)
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th 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
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
| Hi-index | 0.00 |
In this paper we consider 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.