Non-Approximability Results for Scheduling Problems with Minsum Criteria

We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless , none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by APX-hardness proofs.We show that, whereas scheduling on unrelated machines with unit weights is polynomially solvable, the problem becomes APX-hard if release dates or weights are added. We further show APX-hardness for scheduling in flow shops, job shops, and open shops. We also investigate the problems of scheduling on parallel machines with precedence constraints and unit processing times, and two variants of the latter problem with unit communication delays; for these problems we provide lower bounds on the worst-case behavior of any polynomial-time approximation algorithm through the gap-reduction technique.

[1]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Jan Karel Lenstra,et al.  Computing near-optimal schedules , 1995 .

[3]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[4]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[5]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[6]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

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

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

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

[10]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[11]  Gerhard J. Woeginger,et al.  Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine , 1999, SIAM J. Comput..

[12]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[13]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

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

[15]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

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

[17]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[18]  Gerhard J. Woeginger,et al.  Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.

[19]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[20]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[23]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.

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