A note on scheduling equal-length jobs to maximize throughput

Journal of Scheduling

Volumn 9, Issue 1, 2006, Pages 71-73

  Chrobak, Marek ^a   Dürr, Christoph ^b   Jawor, Wojciech ^a   Kowalik, Łukasz ^c   Kurowski, MacIej ^c  

^a University of California Riverside   (United States)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY ALGORITHM; NON-PREEMPTIVE SCHEDULE; POLYNOMIAL-TIME ALGORITHM TECHNIQUE;

ALGORITHMS; DYNAMIC PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

SCHEDULING;

EID: 30344442124     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-5595-4     Document Type: Review

References (5)

1. Baptiste, P., "Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times," Journal of Scheduling, 2, 245-252 (1999).
2. Carlier J., "Problémes d'ordonnancement à durées égales", QUESTIO, 5(4), 219-228 (1981).
3. Chrobak M., C. Dürr, W. Jawor, Ł. Kowalik, and M. Kurowski, "A note on scheduling equal-length jobs to maximize throughput", technical report, arxiv.org, 2004.
4. Garey M., D. Johnson, B. Simons, and R. Tarjan, "Scheduling unit-time tasks with arbitrary release times and deadlines," SIAM Journal on Computing, 10(2),256-269 (1981).
5. Simons. B., "A fast algorithm for single processor scheduling, " in Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS'78), 1978 pp. 246-252.