Improved scheduling algorithms for minsum criteria

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 646-657

  Chakrabarti, Soumen ^a   Phillips, Cynthia A ^b   Schulz, Andreas S ^c   Shmoys, David B ^d   Stein, Cliff ^e   Wein, Joel ^f  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^d Cornell University   (United States)

^e Dartmouth Department of Computer Science_Dartmouth College   (United States)

^f POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; SCHEDULING;

CONSTRAINED SCHEDULING; IDENTICAL PARALLEL MACHINES; NEAR-OPTIMAL SOLUTIONS; PERFORMANCE GUARANTEES; PRECEDENCE CONSTRAINTS; SCHEDULING PROBLEM; TOTAL WEIGHTED COMPLETION TIME; WEIGHTED COMPLETION TIME;

SCHEDULING ALGORITHMS;

EID: 84947720721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_166     Document Type: Conference Paper

References (22)

1. D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal of Computing, 3:149-156, 1991.
2. I. Bárány and T. Fiala. Többgépes ütemezési problémák közel optimalis megoldasa. Szigma-Mat.-Közgazdasagi Folyóirat, 15:177-191, 1982.
3. A. Blum, P. Chalasani, D. Coppersmith, В. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In STOC 26, pages 163-172, 1994.
4. J.L. Bruno, E.G. Coffman, and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382-387, 1974.
5. S. Chakrabarti and S. Muthukrishnan. Resource scheduling for parallel database and scientific applications. To appear in SPAA 96, June 1996.
6. A. Feldmann, M. Kao, J. Sgall, and S. Teng. Optimal online scheduline of parallel jobs with dependencies. In STOC 25, pages 642-653, 1993.
7. M.R. Garey and R.L. Graham. Bounds for multiprocessor scheduling with resource constraints. SI AM Journal on Computing, 4:187-200, 1975.
8. M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. In SODA 7, pages 152-157, 1996.
9. T. Gonzalez and S. Sahni. Open shop scheduling to minimize finish time. Journal of the ACM, 23:665-679, 1976.
10. L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. Joint journal version of [11] and [18]; in preparation.
11. L.A. Hall, D.B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In SODA 7, pages 142-151, 1996.
12. W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846-847, 1973.
13. CA.J. Hurkens and M.J. Coster. On the makespan of a schedule minimizing total completion time for unrelated parallel machines. Unpublished manuscript.
14. D.S. Johnson and K.A. Niemi. On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8:1-14, 1983.
15. W. Ludwig and P. Tiwari. Scheduling malleable and nonmalleable parallel tasks, in SODA 5, pages 167-176, 1994.
16. C. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. In WADS 4, pages 86-97, 1995.
17. M. Queyranne and A.S. Schulz. Polyhedral approaches to machine scheduling. Preprint 408/1994, Dept. of Mathematics, Technical University of Berlin, 1994.
18. A.S. Schulz. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. Preprint 474/1995, Dept. of Mathematics, Technical University of Berlin. To appear in IPCO V, June 1996.
19. D.B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23:617-632, 1994.
20. D.B. Shmoys and E. Tardos. Scheduling parallel machines with costs. In SODA 4, pages 448-455, 1993.
21. W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
22. J. Turek, U. Schwiegeishohn, J. Wolf, and P. Yu. Scheduling parallel tasks to minimize average response time. In SODA 5, pages 112-121, 1994.