Preemptive scheduling of equal-length jobs to maximize weighted throughput

Authors:
Philippe Baptiste;Marek Chrobak;Christoph DüRr;Wojciech Jawor;Nodari Vakhania
Affiliations:
CNRS LIX, Ecole Polytechnique, Palaiseau 91128, France;Department of Computer Science, University of California, Riverside, CA 92521, USA;Laboratoire de Recherche en Informatique, Université Paris-Sud, Orsau 91405, France;Department of Computer Science, University of California, Riverside, CA 92521, USA and CNRS LIX, Ecole Polytechnique, Palaiseau 91128, France;Facultad de Ciencias, Universidad Autonoma del Estado de Morelos, Cuernavaca 62251, Morelos, Mexico
Venue:
Operations Research Letters
Year:
2004

Citing 5
Cited 3

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

Annals of Operations Research
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property

Mathematical and Computer Modelling: An International Journal
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Parallel machine problems with equal processing times: a survey

Journal of Scheduling
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 study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the weighted throughput. In Graham's notation this problem is described as (1|r"j;p"j=p;pmtn|@?w"jU"j). We provide an O(n^4)-time algorithm, improving the previous bound of O(n^1^0).