Single machine precedence constrained scheduling is a vertex cover problem

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

Volumn 4168 LNCS, Issue , 2006, Pages 28-39

  Ambühl, Christoph ^a   Mastrolilli, Monaldo ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; POLYNOMIAL APPROXIMATION; SCHEDULING;

VERTEX COVER PROBLEMS; VERTEX COVER THEORIES; WEIGHTED COMPLETION TIME;

PROBLEM SOLVING;

EID: 33750705907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_6     Document Type: Conference Paper

References (28)

1. Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180, 1994.
2. K. A. Baker, P. C. Fishburn, and F. S. Roberts. Partial orders of dimension 2. Networks, 2:11-28, 1971.
3. C. Chekuri and R. Motwani. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics, 98(1-2) :29-38, 1999.
4. F. A. Chudak and D. S. Hochbaum. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters, 25:199-204, 1999.
5. José R. Correa and Andreas S. Schulz. Single machine scheduling with precedence constraints. Mathematics of Operations Research, 30:1005-1021, 2005.
6. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Ann. of Math. (2), 162(1):439-485, 2005.
7. Michel X. Goemans and David P. Williamson. Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J, Discrete Math., 13(3):281-294, 2000.
8. R. Graham, E. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics, volume 5, pages 287-326. North-Holland, 1979.
9. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line algorithms. Mathematics of Operations Research, 22:513-544, 1997.
10. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
11. Stavros G. Kolliopoulos and George Steiner. Partially-ordered knapsack and applications to scheduling. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA), pages 612-624, 2002.
12. E. L. Lawler. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics, 2:75-90, 1978.
13. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, editors, Handbooks in Operations Research and Management Science, volume 4, pages 445-552. North-Holland, 1993.
14. J. K. Lenstra and A. H. G. Rinnooy Kan. The complexity of scheduling under precedence constraints. Operations Research, 26:22-35, 1978.
15. F. Margot, M. Queyranne, and Y. Wang. Decompositions, network flows and a precedence constrained single machine scheduling problem. Operations Research, 51(6):981-992, 2003.
16. R. H. Möhring. Computationally tractable classes of ordered sets. In I. Rival, editor, Algorithms and Order, pages 105-193. Kluwer Academic, 1989.
17. G. L. Nemhauser and L. E. Trotter. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6:48-61, 1973.
18. G. L. Nemhauser and L. E. Trotter. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
19. V. T. Paschos. A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys, 29(2):171-209, 1997.
20. N. N. Pisaruk. A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time. Discrete Applied Mathematics, 131(3):655-663, 2003.
21. C. N. Potts. An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study, 13:78-87, 1980.
22. Andreas S. Schulz. Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. In Proceedings of the 5th Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 301-315, 1996.
23. P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling, 2(5):203-213, 1999.
24. J. B. Sidney. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research, 23:283-298, 1975.
25. W. E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
26. G. Steiner. Single machine scheduling with precedence constraints of dimension 2. Mathematics of Operations Research, 9(2):248-259, 1984.
27. W. T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. The John Hopkins University Press, Baltimore and London, 1992.
28. G. J. Woeginger. On the approximability of average completion time scheduling under precedence constraints. Discrete Applied Mathematics, 131(1):237-252, 2003.