Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
SRPT optimally utilizes faster machines to minimize flow time
ACM Transactions on Algorithms (TALG)
On-line scheduling of parallel machines to minimize total completion times
Computers and Operations Research
Online Scheduling with Known Arrival Times
Mathematics of Operations Research
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science
Online scheduling to minimize modified total tardiness with an availability constraint
Theoretical Computer Science
A priori parallel machines scheduling
Computers and Industrial Engineering
Information Processing Letters
Mechanism Design for Decentralized Online Machine Scheduling
Operations Research
Resource Allocation Policies for Personalization in Content Delivery Sites
Information Systems Research
Best semi-online algorithms for unbounded parallel batch scheduling
Discrete Applied Mathematics
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Competitive strategies for on-line production order disposal problem
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Competitive analysis of preemptive single-machine scheduling
Operations Research Letters
Computers and Operations Research
| Hi-index | 0.00 |
This paper considers the online 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 two. This result is established using a new proof technique that does not rely explicitly on a lower bound on the optimal objective function value. Because it is known that no online algorithm can have a competitive ratio of less than two, we have resolved the open issue of determining the minimum competitive ratio for this problem.