Preemptive scheduling of equal-length jobs to maximize weighted throughput

Operations Research Letters

Volumn 32, Issue 3, 2004, Pages 258-264

  Baptiste, Philippe ^a   Chrobak, Marek ^b   Dürr, Christoph ^c   Jawor, Wojciech ^b   Vakhania, Nodari ^d  

^a ECOLE POLYTECHNIQUE   (France)

^b University of California Riverside   (United States)

^c UNIVERSITÉ PARIS SACLAY   (France)

^d UNIVERSIDAD AUTÓNOMA DEL ESTADO DE MORELOS   (Mexico)

Author keywords

Single machine preemptive scheduling; Weighted throughput

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING; MULTIPROCESSING SYSTEMS; POLYNOMIALS; SCHEDULING; SET THEORY; THROUGHPUT;

PREEMPTIVE SCHEDULING; WEIGHTED THROUGHPUT;

OPERATIONS RESEARCH;

EID: 0346280052     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.09.004     Document Type: Article

References (12)

1. 4) algorithm for preemptive scheduling of a singler machine to minimize the number of late jobs Oper. Res. Lett. 24:1999;175-180.
2. Baptiste P. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Schedul. 2:1999;245-252.
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 .
6. P. Brucker, S.A. Kravchenko, Preemption can make parallel machine scheduling problems hard, Osnabrück. Schrif. Math. 211 (1999).
7. Carlier J. Problèmes d'ordonnancement à durées égales. QUESTIO. 5(4):1981;219-228.
8. Du J., Leung J.Y.T., Wong C.S. Minimizing the number of late jobs with release time constraint. J. Combin. Math. Combin. Comput. 11:1992;97-107.
9. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
10. over : an optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems SIAM J. Comput. 24:1995;318-339.
11. Lawler E.L. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26:1990;125-133.
12. Lawler E.L. Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property. Math. Comput. Modelling. 20(2):1994;91-106.