Scheduling with release dates on a single machine to minimize total weighted completion time
Discrete Applied Mathematics
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Job scheduling methods for reducing waiting time variance
Computers and Operations Research
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On-line scheduling to minimize average completion time revisited
Operations Research Letters
| Hi-index | 0.00 |
This paper considers the on-line scheduling of a single machine in which jobs arrive over time, and preemption is not allowed. The goal is to minimize the total weighted completion time. We show that a simple modification of the shortest weighted processing time rule has a competitive ratio of 2. This result is established using a new proof technique which does not rely explicitly on a lower bound on the optimal objective function value. Since it is known that no on-line algorithm can have a competitive ratio of less than 2, we have resolved the open issue of determining the minimum competitive ratio for this problem.