Minimizing the flow time without migration

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1370-1382

  Awerbuch, Baruch ^a   Azar, Yossi ^a   Leonardi, Stefano ^a   Regev, Oded ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Approximation; Flow time; Migration; Online; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER OPERATING SYSTEMS; ONLINE SYSTEMS; PROBLEM SOLVING; SCHEDULING;

PROCESSING TIME;

MULTIPROCESSING SYSTEMS;

EID: 0036588836     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970037446X     Document Type: Article

References (8)

1. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
2. J. Du, J.Y.T. Leung, and G.H. Young, Minimizing mean flow time with release time constraint, Theoret. Comput. Sci., 75 (1990), pp. 347-355.
3. L. Hall, D. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Math. Oper. Res., 22 (1997), pp. 513-544.
4. L.A. Hall, Approximation algorithms for scheduling, in Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum, ed., PWS, Boston, 1997, pp. 1-45.
5. B. Kalyanasundaram and K. Pruhs, Eliminating migration in multi-processor scheduling, J. Algorithms, 38 (2001), pp. 2-24.
6. H. Kellerer, T. Tautenhahn, and G.J. Woeginger, Approximability and nonapproximability results for minimizing total flow time on a single machine, SIAM J. Comput., 28 (1999), pp. 1155-1166.
7. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in Handbooks in Operations Research and Management Science, Vol. 4, North-Holland, Amsterdam, 1993, pp. 445-522.
8. S. Leonardi and D. Raz, Approximating total flow time on parallel machines, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, El Paso, Texas, 1997, pp. 110-119.