Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts

Authors:
Rob van Stee;Han La Poutré
Affiliations:
-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 5
Cited 1

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
Lower Bounds for On-Line Single-Machine Scheduling

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
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

Lower bounds for on-line single-machine scheduling

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.