A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor

Authors:
Nodari Vakhania
Affiliations:
State University Morelos, Science Faculty, Cuernavaca, Morelos, Mexico
Venue:
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Year:
2008

Citing 3
Cited 3

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

Annals of Operations Research
A Note on Scheduling Equal-Length Jobs to Maximize Throughput

Journal of Scheduling
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Preemptive scheduling of jobs with tied parameters on a single processor to minimize the number of late jobs

AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Online scheduling of bounded length jobs to maximize throughput

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling of bounded length jobs to maximize throughput

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a fast on-line algorithm for preemptive scheduling of equal-length jobs with due dates. The jobs are released on-line over time. We have a single processor that can handle at most one job simultaneously. Our objective is to minimize the number of late jobs, ones completed after their due dates.