Approximation Algorithms for Minimizing AverageWeighted Completion Time

Sanjeev Khanna University of Pennsylvania 11.

[1]  van den Jm Marjan Akker,et al.  Facet inducing inequalities for single-machine scheduling problems , 1993 .

[2]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[3]  Frits C. R. Spieksma,et al.  Scheduling jobs of equal length: complexity, facets and computational results , 1995, Math. Program..

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

[5]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[6]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

[7]  Rajeev Motwani,et al.  Profile-driven instruction level parallel scheduling with application to super blocks , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.

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

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

[10]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[11]  Martin W. P. Savelsbergh,et al.  A Time-Indexed Formulation for Single-Machine Scheduling Problems: Branch-and-Cut , 1996 .

[12]  Fabián A. Chudak,et al.  Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds , 1997, SODA '97.

[13]  E. Balas.  On the facial structure of scheduling polyhedra , 1985 .

[14]  Donald L. Adolphson,et al.  Single Machine Job Sequencing with Precedence Constraints , 1977, SIAM J. Comput..

[15]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, SIAM J. Comput..

[16]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[17]  Gerhard J. Woeginger,et al.  On the approximability of average completion time scheduling under precedence constraints , 2001, Discret. Appl. Math..

[18]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[19]  Eric Torng,et al.  Existence theorems, lower bounds and algorithms for scheduling to meet two objectives , 2002, SODA '02.

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

[21]  J. M. van den Akker,et al.  LP-based solution methods for single-machine scheduling problems , 1994 .

[22]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[23]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

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

[25]  Sanjeev Khanna,et al.  A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines , 2001, ICALP.

[26]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[27]  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).

[28]  Andreas S. Schulz,et al.  Facets of the Generalized Permutahedron of a Poset , 1997, Discret. Appl. Math..

[29]  R. Motwani,et al.  Precedence Constrained Scheduling to Minimize Weighted Completion Time on a Single Machine , 1998 .

[30]  Clifford Stein,et al.  Improved bicriteria existence theorems for scheduling , 2002, SODA '99.

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

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

[33]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

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

[35]  Martin Skutella,et al.  Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..

[36]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[37]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[38]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[39]  Clifford Stein,et al.  On the existence of schedules that are near-optimal for both makespan and total weighted completion time , 1997, Oper. Res. Lett..

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

[41]  Fabián A. Chudak.  A min‐sum 3/2‐approximation algorithm for scheduling unrelated parallel machines , 1999 .

[42]  Maxim Sviridenko,et al.  Approximation algorithms for shop scheduling problems with minsum objective , 2002 .

[43]  Maurice Queyranne,et al.  Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling , 1992, IPCO.

[44]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[45]  Michel X. Goemans,et al.  Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.

[46]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[47]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..

[48]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[49]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

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

[51]  Martin Skutella,et al.  Scheduling precedence-constrained jobs with stochastic processing times on parallel machines , 2001, SODA '01.

[52]  Maurice Queyranne,et al.  Structure of a simple scheduling polyhedron , 1993, Math. Program..

[53]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

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

[55]  Gerhard J. Woeginger,et al.  A PTAS for minimizing the weighted sum of job completion times on parallel machines , 1999, STOC '99.

[56]  Laurence A. Wolsey,et al.  A time indexed formulation of non-preemptive single machine scheduling problems , 1992, Math. Program..

[57]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

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

[59]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .