Online computation and competitive analysis
Online computation and competitive analysis
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
An optimal online algorithm for single machine scheduling to minimize total general completion time
Journal of Combinatorial Optimization
Optimal algorithms for online single machine scheduling with deteriorating jobs
Theoretical Computer Science
On-line scheduling on a batch machine to minimize makespan with limited restarts
Operations Research Letters
Hi-index | 0.00 |
We give an algorithm to minimize the total completion time on-line on a single machine, using restarts, with a competitive ratio of 3/2. The optimal competitive ratio without using restarts is 2 for deterministic algorithms and e/(e-1)~1.582 for randomized algorithms. This is the first restarting algorithm to minimize the total completion time that is proved to be better than an algorithm that does not restart.