Preemptive scheduling of equal-length jobs to maximize weighted throughput-Reference-Cited by-同舟云学术

Preemptive scheduling of equal-length jobs to maximize weighted throughput

Published:2004-05 Issue:3 Volume:32 Page:258-264
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Baptiste Philippe,Chrobak Marek,Dürr Christoph,Jawor Wojciech,Vakhania Nodari

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference12 articles.

1. An O(n4) algorithm for preemptive scheduling of a singler machine to minimize the number of late jobs;Baptiste;Oper. Res. Lett.,1999

2. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times;Baptiste;J. Schedul.,1999

3. P. Baptiste, Preemptive scheduling of identical machines, Technical Report, Universite de Technologie de Compiegne, France, 2000.

4. P. Baptiste, P. Brucker, S. Knust, V.G. Timkovsky, Fourteen notes on equal-processing-time scheduling, Osnabrücker Schriften zur Mathematik, Reihe P, No. 211 (1999).

5. P. Brucker, S. Knust, Complexity results for scheduling problems, www.mathematik.uni-osnabrueck.de/research/OR/class.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling Equal-Processing-Time Jobs Under Time-of-Use Tariffs;2024

2. Competitive two-agent scheduling with release dates and preemption on a single machine;Journal of Scheduling;2023-03-27

3. A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems;European Journal of Operational Research;2023-03

4. Time-of-Use Scheduling Problem with Equal-Length Jobs;Lecture Notes in Computer Science;2022

5. The Price of Bounded Preemption;ACM Transactions on Parallel Computing;2021-04