List scheduling in order of α-points on a single machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3484 LNCS, Issue , 2006, Pages 250-291

  Skutella, Martin ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

LINEAR PROGRAMMING RELAXATION; SINGLE MACHINE SCHEDULING PROBLEMS; STRUCTURAL INFORMATION;

APPROXIMATION THEORY;

EID: 36849090078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671541_9     Document Type: Article

References (52)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 32-43, New York City, NY, 1999.
2. J. M. van den Akker. LP-Based Solution Methods for Single-Machine Scheduling Problems. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.
3. E. J. Anderson and C. N. Potts. On-line scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29:686-697, 2004.
4. K. R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, New York, 1974.
5. C. C. B Cavalcante, C. C. de Souza, M. W. P. Savelsbergh, Y. Wang, and L. A. Wolsey. Scheduling projects with labor constraints. Discrete Applied Mathematics, 112:27-52, 2001.
6. S. Chakrabarti and S. Muthukrishnan. Resource scheduling for parallel database and scientific applications. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 329-335, Padua, Italy, 1996.
7. S. Chakrabarti, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for minsum criteria. In F. Meyer auf der Heide and B. Monien, editors, Automata, Languages and Programming, volume 1099 of Lecture Notes in Computer Science, pages 646-657. Springer, Berlin, 1996.
8. L. M. A. Chan, A. Muriel, and D. Simchi-Levi. Parallel machine scheduling, linear programming and list scheduling heuristics. Operations Research, 46:729-741, 1998.
9. C. S. Chekuri, R. Johnson, R. Motwani, B. Natarajan, B. R. Rau, and M. Schlansker. Profile-driven instruction level parallel scheduling with applications to super blocks. In Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 58-67, Paris, France, 1996.
10. C. S. Chekuri and R. Motwani. Precedence constrained scheduling to minimize weighted completion time on a single machine. Discrete Applied Mathematics, 98:29-38, 1999.
11. C.S. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31:146-166, 2001.
12. J. R. Correa and A. S. Schulz. Single machine scheduling with precedence constraints. In D. Bienstock and G. Nemhauser, editors, Integer Programming and Combinatorial Optimization, volume 3064 of Lecture Notes in Computer Science, pages 283-297. Springer, Berlin, 2004.
13. M. E. Dyer and L. A. Wolsey. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26:255-270, 1990.
14. L. Epstein and R. van Stee. Lower bounds for on-line single machine scheduling. Theoretical Computer Science, 299:439-450, 2003.
15. M. X. Goemans. A supermodular relaxation for scheduling with release dates. In W. H. Cunningham, S. T. McCormick, and M. Queyranne, editors, Integer Programming and Combinatorial Optimization, volume 1084 of Lecture Notes in Computer Science, pages 288-300. Springer, Berlin, 1996.
16. M. X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 591-598, New Orleans, LA, 1997.
17. M. X. Goemans, M. Queyranne, A. S. Schulz, M. Skutella, and Y. Wang. Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics, 15:165-192, 2002.
18. M. X. Goemans, J. Wein, and D. P. Williamson. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters, 26:149-154, 2000.
19. M. X. Goemans and D. P. Williamson. Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM Journal on Discrete Mathematics, 13:281-294, 2000.
20. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287-326, 1979.
21. 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, 1997.
22. L. A. Hall, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 142-151, Atlanta, GA, 1996.
23. J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In W H. Cunningham, S. T. McCormick, and M. Queyranne, editors, Integer Programming and Combinatorial Optimization, volume 1084 of Lecture Notes in Computer Science, pages 404-414. Springer, Berlin, 1996.
24. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank, editor, Progress in Combinatorial Optimization, pages 245-261. Academic Press, New York, 1984.
25. F. Margot, M. Queyranne, and Y. Wang. Decomposition, network flows and a precedence constrained single machine scheduling problem. Operations Research, 51:981-992, 2003.
26. R. H. Möhring, A. S. Schulz, F. Stork, and M. Uetz. Solving project scheduling problems by minimum cut computations. Management Science, 49:330-350, 2003.
27. R. H. Möhring, A. S. Schulz, and M. Uetz. Approximation in stochastic scheduling: The power of LP-based priority policies. Journal of the ACM, 46:924-942, 1999.
28. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
29. C. Phillips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming, 82:199-223, 1998.
30. C. N. Potts. An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Studies, 13:78-87, 1980.
31. M. Queyranne. Structure of a simple scheduling polyhedron. Mathematical Programming, 58:263-285, 1993.
32. M. W. P. Savelsbergh, R. N. Uma, and J. M. Wein. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 453-462, San Francisco, CA, 1998.
33. A. S. Schulz. Polytopes and scheduling. PhD thesis, TU Berlin, Germany, 1996.
34. A. S. Schulz. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In W. H. Cunningham, S. T. McCormick, and M. Queyranne, editors, Integer Programming and Combinatorial Optimization, volume 1084 of Lecture Notes in Computer Science, pages 301-315. Springer, Berlin, 1996.
35. A. S. Schulz and M. Skutella. Random-based scheduling: New approximations and LP lower bounds. In J. Rolim, editor, Randomization and Approximation Techniques in Computer Science, volume 1269 of Lecture Notes in Computer Science, pages 119-133. Springer, Berlin, 1997.
36. A. S. Schulz and M. Skutella. The power of a-points in preemptive single machine scheduling. Journal of Scheduling, 5:121-133, 2002.
37. A. S. Schulz and M. Skutella. Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics, 15:450-469, 2002.
38. P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling, 2:203-213, 1999.
39. J. Sgall. On-line scheduling - a survey. In A. Fiat and G. J. Woeginger, editors. Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science, pages 196-231. Springer, Berlin, 1998.
40. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461-474, 1993.
41. J. B. Sidney. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research, 23:283-298, 1975.
42. M. Skutella. Approximation and randomization in scheduling. PhD thesis, Technische Universität Berlin, Germany, 1998.
43. M. Skutella and M. Uetz. Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 589-590, Washington, DC, 2001.
44. M. Skutella and M. Uetz. Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing, 2005. To appear.
45. W. E. Smith. Various optimizers for single-stage production. Naval Research and Logistics Quarterly, 3:59-66, 1956.
46. J. P. Sousa. Time indexed formulations of non-preemptive single-machine scheduling problems. PhD thesis, Université Catholique de Louvain, 1989.
47. C. Stein and J. Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21:115-122, 1997.
48. L. Stougie and A. P. A. Vestjens. Randomized algorithms for on-line scheduling problems: How low can't you go? Operations Research Letters, 30:89-96, 2002.
49. R. N. Uma and J. M. Wein. On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems. In R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 394-408. Springer, Berlin, 1998.
50. A. P. A. Vestjens. On-line machine scheduling. PhD thesis, Eindhoven University of Technology, The Netherlands, 1997.
51. G.J. Woeginger. On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics, 131:237-252, 2003.
52. L. A. Wolsey. Mixed integer programming formulations for production planning and scheduling problems, 1985. Invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge.