Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

Authors:
Nodari Vakhania
Affiliations:
Science Faculty, State University of Morelos, Mexico and Inst. of Computational Math., Georgian Academy of Sciences, Georgia
Venue:
Operations Research Letters
Year:
2009

Citing 2
Cited 2

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

Annals of Operations Research
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
Branch less, cut more and minimize the number of late equal-length jobs on identical machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a direct combinatorial O(n^3logn) algorithm for minimizing the number of late jobs on a single machine when jobs have release times and preemptions are allowed. Our algorithm improves the earlier O(n^5) and O(n^4) dynamic programming algorithms for this problem.