Papers to Read
Hard Copies
- L. A. Hall.
Approximation Algorithms for NP-hard problems, Chapter 1.
PWS Publishing Company, 1997.
D. Hochbaum, editor.
- Pinedo . Scheduling Algorithms. Introduction.
On-line Papers Covered in Class
- L. Hall and D. B. Shmoys.
Approximation schemes for constrained scheduling problems.
In Proceedings of the 30th Annual Symposium on Foundations of
Computer Science , pages 134--141. IEEE, October 1989.
pdf file
- K. R. Baker, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan.
Preemptive scheduling of a single machine to minimize maximum cost
subject to release dates and precedence constraints.
Operations Research, 31:381--386, 1983.
pdf file
- C. Chekuri, R. Motwani, B. Natarajan, C. Stein.
Approximation techniques for average completion time scheduling.
SIAM J. Computing. 31 (1): 146--166, 2001.
ps file
- H. Gabow. A linear-time algorithm for two processor scheduling.
Journal of the ACM, 29:766--780, 1982.
pdf file
- D.S. Hochbaum and D.B. Shmoys.
Using dual approximation algorithms for scheduling problems:
theoretical and practical results.
Journal of the ACM , 34:144--162, 1987.
pdf file
- D. Karger , J. Wein and C. Stein. Scheduling Algorithms. In
CRC Handbook on Algorithms . CRC Press. 1998.
ps file
- 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".
Mathematics of Operations Research
22: 513-544, `997.
ps file
-
H. Kellerer and T. Tautenhahn and G. J. Woeginger.
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine .
SIAM Journal on Computing, 1999, Vol. 28 Issue 4, p1155--1167
ps file
-
Bala Kalyanahsundaram and Kirk Pruhs,
Speed is as powerful as clairvoyance.
Journal of the ACM
47 (4) : 617--643, 2000
ps file
- E.L. Lawler and J.Labetoulle.
On preeemptive scheduling of of unrelated parallel processors by
linear programming.
Journal of the ACM, 25:612--619, 1978.
pdf file
- R. McNaughton. Scheduling with deadlines and loss functions.
Management Science , 6:1--12, 1959.
pdf file
-
Cynthia A. Phillips and Cliff Stein and Eric Torng and Joel Wein.
Optimal time-critical scheduling via resource augmentation.
Algorithmica
32: 163--2000, 2001.
ps file
-
C. Phillips, C. Stein and J. Wein.
Minimizing average completion time in the presence of release dates.
Mathematical Programming A, 82: 199--223, 1998.
ps file
- D. B. Shmoys and E. Tardos.
An approximation algorithm for the generalized assignment problem.
Mathematical Programming A , 62:461--474, 1993.
pdf file
- Chekuri and Motwani
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
ps file
Some Suggestions for Papers to base a course project on
- Svennson, Santa Claus Schedules Jobs on Unrelated Machines,
pdf file
- Bansal, Srinivasan, Svennson, Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. STOC 2016
pdf file
- Banal and Pruhs, The Geometry of Scheduling,SIAM J. Comp., 43(5), 2014.
pdf file
- Bansal, Chan and Pruhs, Competitive Algorithms for Due Date Scheduling, Algorithmica, 2011
pdf file
- Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein: Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153,
pdf file
- Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA 2012: 173-186
pdf file
- Elaine Levey, Thomas Rothvoss:
A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. STOC 2016: 168-177
pdf file
- Friedrich Eisenbrand, Thomas Rothvoß:
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. ICALP (1) 2008: 246-257
pdf file
- Martin Skutella, Maxim Sviridenko, Marc Uetz:
Unrelated Machine Scheduling with Stochastic Processing Times. Math. Oper. Res. 41(3): 851-864 (2016)
pdf file
- Martin Skutella, Marc Uetz:
Stochastic Machine Scheduling with Precedence Constraints. SIAM J. Comput. 34(4): 788-802 (2005)
pdf file
-
Martin Skutella:
Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2): 206-242 (2001)
pdf file
-
Lin Chen, Nicole Megow, Kevin Schewior,
An O(log m)-Competitive Algorithm for Online Machine Minimization,
SODA 2016
pdf file
- Epstein et.al. Universal Sequencing on an Unreliable Machine, SIAM J. Comput., 41(3), 565–586.
pdf file
Bansal, N,
Chan, HL,
Khandekar, R,
Pruhs, K,
Schieber, B,
Stein, C,
Non-preemptive min-sum scheduling with resource augmentation
Proceedings - Annual Ieee Symposium On Foundations Of Computer Science, Focs, 2007, p. 614-624
pdf file
-
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs: Speed scaling with an arbitrary power function. SODA 2009: 693-701
pdf file
-
Sungjin Im, Benjamin Moseley, Kirk Pruhs: Online Scheduling with General Cost Functions. SIAM J. Comput. 43(1): 126-143 (2014)
pdf file
-
Tomás Ebenlendr, Marek Krcál, Jirí Sgall: Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Algorithmica 68(1): 62-80 (2014)
pdf file
-
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý: Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. SIAM J. Comput. 36(6): 1709-1728 (2007)
pdf file