On-line scheduling on a single machine: maximizing the number of early jobs

Authors:
Han Hoogeveen;Chris N. Potts;Gerhard J. Woeginger
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, 3584 CH Utrecht, The Netherlands;Faculty of Mathematical Studies, University of Southampton, Southampton SO17 1BJ, UK;TU Graz, Institut für Mathematik B, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
2000

Citing 6
Cited 13

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
Scheduling Parallel Machines On-line

SIAM Journal on Computing
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Maximizing Job Completions Online

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

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

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On maximizing the throughput of multiprocessor tasks

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

Journal of Algorithms
Online market driven spectrum scheduling and auction

Proceedings of the 2009 ACM workshop on Cognitive radio networks
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Online preemptive scheduling with immediate decision or notification and penalties

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online deadline scheduling with preemption penalties

Computers and Industrial Engineering
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

Journal of Scheduling
Temperature aware online algorithms for scheduling equal length jobs

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
TOFU: semi-truthful online frequency allocation mechanism for wireless network

IEEE/ACM Transactions on Networking (TON)
Laxity helps in broadcast scheduling

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Temperature aware online algorithms for scheduling equal length jobs

Theoretical Computer Science
Online scheduling with preemption or non-completion penalties

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest remaining processing time (SRPT) rule yields an on-line algorithm with competitive ratio 12. Moreover, we show that there does not exist an on-line algorithm with a better performance guarantee.