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
A guessing game and randomized online algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Scheduling Unrelated Machines by Randomized Rounding
SIAM Journal on Discrete Mathematics
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
Online Scheduling to Minimize Average Stretch
SIAM Journal on Computing
Mathematical Programming: Series A and B
Utilization of nonclairvoyant online schedules
Theoretical Computer Science
LP-based online scheduling: from single to parallel machines
Mathematical Programming: Series A and B
On-line scheduling of parallel machines to minimize total completion times
Computers and Operations Research
Almost sure asymptotic optimality for online routing and machine scheduling problems
Networks - Networks Optimization Workshop, August 22–25, 2006
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A class of on-line scheduling algorithms to minimize total completion time
Operations Research Letters
On-line scheduling to minimize average completion time revisited
Operations Research Letters
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
Completion time scheduling and the WSRPT algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization
Information Processing Letters
Computers and Operations Research
| Hi-index | 0.00 |
We analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average completion time objective. For weighted completion times we give a deterministic algorithm with competitive ratio 1.791+o(m). This ratio holds for preemptive and non-preemptive scheduling.