Scheduling jobs with communication delays: Using infeasible solutions for approximation extended abstract

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

Volumn 1136, Issue , 1996, Pages 76-90

  Möhring, Rolf H ^a   Schäffter, Markus W ^a   Schulz, Andreas S ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; JOB SHOP SCHEDULING; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

IDENTICAL PARALLEL PROCESSORS; INTER PROCESSOR COMMUNICATION; MULTI PROCESSOR SCHEDULING; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; PRECEDENCE CONSTRAINTS; WEIGHTED COMPLETION TIME; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS;

EID: 84958053242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_48     Document Type: Conference Paper

References (22)

1. P. Chrétienne and C. Picouleau, Scheduling with communication delays: a survey, Scheduling Theory and its Applications (P. Chrétienne, E. G. Coffman Jr, J. K. Lenstra, and Z. Liu, eds.), John Wiley & Sons, 1995, pp. 65-90.
2. S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, 1996, To appear in Springer Lecture Notes in Computer Science, Proceedings of the 23rd ICALP Conference.
3. M. X. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996.
4. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, Springer, Berlin, 1988.
5. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Tech J 45 (1966), 1563-1581.
6. C. Hanen and A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, Preprint, Laboratoire Informatique Théorique et Programmation, Institut Blaise Pascal, Université Pierre et Marie Curie, 1995.
7. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Preprint 516/1996, Department of Mathematics, University of Technology, Berlin, Germany, 1996, sub- mitted.Available from ftP://ftP-math.tu-berlin.de/pub/Preprints/combi/Report-516-1996.Ps.Z.
8. L. A. Hall, D. B. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line algorithms, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 142-151.
9. J. A. Hoogeveen, B. Veltman, and J. K. Lenstra, Three, four, five, six, or the complexity of scheduling with communication delays, Operations Research Letters 16 (1994), 129-137.
10. E. L. Lawler, Scheduling trees on multiprocessors with unit communication delays, Presented at the First Workshop on Models and Algorithms for Planning and Scheduling Problems, unpublished manuscript, June 1993.
11. J. K. Lenstra, M. Veldhorst, and B. Veltman, The complexity of scheduling trees with communication delays, Journal of Algorithms 20 (1996), 157-173.
12. A. Munier and J.-C. König, A heuristic for a scheduling problem with communication delays, Preprint 871, Laboratoire de Recherche en informatique, Université de Paris, France, 1993, to appear in Operations Research, 1996.
13. R. H. Mohring, Computationally tractable classes of ordered sets, Algorithms and Order (I. Rival, ed.), Nato Advanced Study Institutes Series, D. Reidel Publishing Company, Dordrecht, 1989, pp. 105-193.
14. R. H. Möhring and M. W. Schäffter, A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays, Preprint No. 506/1996, University of Technology, Berlin, 1996, ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-506-1995.ps.Z.
15. R. H. Möhring, M. W. Schäffter, and A. S. Schulz, Scheduling jobs with communication delays: Using infeasible solutions for approximation, Preprint 517/1996, Department of Mathematics, University of Technology, Berlin, Germany, 1996.
16. C. Picouleau, New complexity results on scheduling with small communication delays, Discrete Applied Mathematics 60 (1995), 331-342.
17. C. Phillips, C. Stein, and J. Wein, Scheduling jobs that arrive over time, Proceedings of the Fourth Workshop on Algorithms and Data Structures (Berlin), Lecture Notes in Computer Science, no. 955, Springer, Berlin, 1995, pp. 86-97.
18. V. J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Applied Math. 18 (1987), 55-71.
19. A. S. Schulz, Polytopes and scheduling, Ph.D. thesis, University of Technology, Berlin, Germany, 1995.
20. S. Schulz, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, Integer Programming and Combinatorial Optimization (Berlin) (W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds.), Lecture Notes in Computer Science, no. 1084, Springer, Berlin, 1996, Proceedings of the 5th International IPCO Conference, pp. 301-315.
21. J. Verriet, Scheduling UET, UCTdags with release dates and deadlines, Preprint No. UU-CS-1995-31, Utrecht University, Department of Computer Science, 1995.
22. Veltman, B. Lageweg, and J. K. Lenstra, Multiprocessor scheduling with commmunication delays, Parallel Computing 16 (1990), 173-182.