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

Authors:
Nodari Vakhania
Affiliations:
State University Morelos, Science Faculty, Cuernavaca, Morelos, Mexico and Institute of Computational Mathematics, Georgian Academy of Sciences, Tbilisi, Georgia
Venue:
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Year:
2010

Citing 4
Cited 0

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

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

CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

Operations Research Letters
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have n jobs with release times and due-dates to be scheduled on a single-machine that can handle at most one job at a time. Our objective is to minimize the number of late jobs, ones completed after their due-dates. This problem is known to be solvable in time O(n4). We show that the special case of the problem when job processing times and due-dates are tied so that for each pair of jobs i, j with di dj, pi ≥ pj, can be solved in time O(n2). This particular setting has real-life applications.