Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2004

Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput

Philippe Baptiste
  • Fonction : Auteur
Marek Chrobak
  • Fonction : Auteur
Wojciech Jawor
  • Fonction : Auteur
Nodari Vakhania
  • Fonction : Auteur

Résumé

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, which is the total weight of completed jobs. In Graham\'s notation this problem is described as (1 | r_j;p_j=p;pmtn | sum w_j U_j). We provide an O(n^4)-time algorithm for this problem, improving the previous bound of O(n^{10}) by Baptiste.

Dates et versions

hal-00012905 , version 1 (29-10-2005)

Identifiants

Citer

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania. Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput. Operations Research Letters, 2004, 32,No.3, pp.258-264. ⟨hal-00012905⟩
52 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More