The complexity of mean flow time scheduling problems with release times

Journal of Scheduling

Volumn 10, Issue 2, 2007, Pages 139-146

  Baptiste, Philippe ^a   Brucker, Peter ^b   Chrobak, Marek ^c   Dürr, Christoph ^a   Kravchenko, Svetlana A ^d   Sourd, Francis ^e  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF OSNABRÜCK   (Germany)

^c University of California Riverside   (United States)

^d UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^e UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Linear programming; Preemption; Scheduling theory

Indexed keywords

FLOW TIME; PARALLEL MACHINES; PREEMPTION; SCHEDULING THEORY;

ALGORITHMS; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

JOB ANALYSIS;

EID: 33847292479     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-0006-4     Document Type: Article

References (10)

1. Baptiste, Ph., "Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal," Journal of Scheduling, 2, 245-252 (1999).
2. Baptiste Ph., J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, and M. Sviridenko, "Structural properties of preemptive schedules," Journal of Scheduling (to appear).
3. Brucker, P., B. Jurisch, and M. Jurisch, "Open-shop problems with unit time operations," Zeitschrift für Operations Research. 37, 59-73 (1993).
4. Du, J., J. Y.-T. Leung, and G. H. Young, "Minimizing mean flow time with release time constraint," Theoretical Computer Science, 75, 347-355 (1990).
5. Herrbach, L. A. and J. Y.-T. Leung, "Preemptive scheduling of equal length jobs on two machines to minimize mean flow time," Operations Research, 38, 487-494 (1990).
6. Kravchenko, S. A., "On the complexity of minimizing the number of late jobs in unit time open shop," Discrete Applied Mathematics, 100, 127-132 (2000).
7. Leung, J. Y.-T. and G. H. Young, "Preemptive scheduling to minimize mean weighted flow time," Information Processing Letters, 34, 47-50 (1990).
8. Schrijver, A. Combinatorial Optimization, Springer Verlag, 2003.
9. Tardos, E., "A strongly polynomial algorithm to solve combinatorial linear programs," Operations Research, 34, 250-256 (1986).
10. Tautenhahn, T. and G. J. Woeginger, "Minimizing the total completion time in a unit-time open shop with release times," Operations Research Letters, 20, 207-212 (1997).