Minimizing the total completion time on-line on a single machine, using restarts

Authors:
Rob van Stee;Han La Poutré
Affiliations:
Centre for Mathematics and Computer Science, Kruislaan, SJ Amsterdam, The Netherlands;Centre for Mathematics and Computer Science, Kruislaan, SJ Amsterdam, The Netherlands and Eindhoven University of Technology, School of Technology Management, Den Dolech, MB Eindhoven, The Netherl ...
Venue:
Journal of Algorithms
Year:
2005

Citing 5
Cited 3

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
On-line scheduling on a single machine: maximizing the number of early jobs

Operations Research Letters

Online scheduling in a parallel batch processing system to minimize makespan using restarts

Theoretical Computer Science
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.