Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-relaxation or to a convex quadratic-programming relaxation. We also investigate dominance relations among the lower bounds resulting from these relaxations.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[3]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[4]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[5]  Han Hoogeveen,et al.  Non-approximability Results for Scheduling Problems with Minsum Criteria , 1998, IPCO.

[6]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[7]  Martin Skutella,et al.  Random-Based Scheduling: New Approximations and LP Lower Bounds , 1997, RANDOM.

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

[9]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[10]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[11]  R. N. Uma,et al.  On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems , 1998, IPCO.

[12]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[13]  Martin Skutella,et al.  Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria , 1997, ESA.

[14]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[15]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[16]  Cynthia A. Phillips,et al.  Task Scheduling in Networks , 1997, SIAM J. Discret. Math..

[17]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

[19]  Chris N. Potts,et al.  Unrelated parallel machine scheduling using local search , 1994 .

[20]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[21]  Chris N. Potts,et al.  Heuristics for scheduling unrelated parallel machines , 1991, Comput. Oper. Res..