Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)

In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems.

[1]  Jean-Claude König,et al.  A Heuristic for a Scheduling Problem with Communication Delays , 1997, Oper. Res..

[2]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[3]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[4]  Jacques Verriet.  Scheduling UET, UCT dags with release dates and deadlines , 1995 .

[5]  Christophe Picouleau.  New Complexity Results on Scheduling with Small Communication Delays , 1995, Discret. Appl. Math..

[6]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[7]  Rolf H. Möhring,et al.  Computationally Tractable Classes of Ordered Sets , 1989 .

[8]  Han Hoogeveen,et al.  Three, four, five, six, or the complexity of scheduling with communication delays , 1994, Oper. Res. Lett..

[9]  Jan Karel Lenstra,et al.  The Complexity of Scheduling Trees with Communication Delays , 1996, J. Algorithms.

[10]  B. J. Lageweg,et al.  Multiprocessor scheduling with communication delays , 1990, Parallel Comput..

[11]  Rolf H. Möhring,et al.  A Simple Approximation Algorithm for Scheduling Forests with Unit Processing Times and Zero-One Communication Delays , 1995 .

[12]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[13]  Andreas S. Schulz.  Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds , 1996, IPCO.

[14]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[15]  I. Rival.  Algorithms and Order , 1988 .

[16]  Cynthia A. Phillips,et al.  Improved Scheduling Algorithms for Minsum Criteria , 1996, ICALP.

[17]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[18]  Cynthia A. Phillips,et al.  Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.

[19]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[20]  C. Hanen,et al.  An approximation algorithm for scheduling dependent tasks on m processors with small communication delays , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.