Single machine scheduling with precedence constraints extended abstract

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

Volumn 3064, Issue , 2004, Pages 283-297

  Correa, José R ^a   Schulz, Andreas S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DOMAIN DECOMPOSITION METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MACHINERY; MATHEMATICAL PROGRAMMING; SCHEDULING;

DECOMPOSITION THEOREMS; LINEAR PROGRAMMING RELAXATION; PRECEDENCE CONSTRAINTS; SEQUENCING PROBLEMS; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; VERTEX COVER PROBLEMS; WEIGHTED COMPLETION TIME;

SCHEDULING ALGORITHMS;

EID: 35048873150     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_22     Document Type: Article

References (26)

1. E. Balas, "On the facial structure of scheduling polyhedra", Mathematical Programming Study 24, 179-218, 1985.
2. C. Chekuri & R. Motwani, "Precedence constrained scheduling to minimize sum of weighted completion time on a single machine", Discrete Applied Mathematics 98, 29-38, 1999.
3. F. Chudak & 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.
4. M.E. Dyer & L.A. Wolsey, "Formulating the single machine sequencing problem with release dates as a mixed integer program", Discrete Applied Mathematics 26, 255-270, 1990.
5. W.L. Eastman, S. Even & I.M. Isaacs, "Bounds for the optimal scheduling of n jobs on m processors", Management Science 11, 268-279, 1964.
6. M.X. Goemans & D.P. Williamson, "Two dimensional Gantt charts and a scheduling algorithm of Lawler", SIAM Journal on Discrete Mathematics 13, 281-294, 2000.
7. R.L. Graham, E.L. Lawler, J.K. Lenstra & A.H.G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey", Annals of Discrete Mathematics 5, 287-326, 1979.
8. L.A. Hall, D.B. Shmoys & J. Wein, "Scheduling to minimize average completion time: Off-line and on-line algorithms", Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 142-151, 1996.
9. L.A. Hall, A.S. Schulz, D.B. Shmoys & J. Wein, "Scheduling to minimize average completion time: Off-line and on-line approximation 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. S. Kolliopoulos & G. Steiner, "Partially-ordered knapsack and applications to scheduling", R.H. Möhring, R. Raman (eds.), Algorithms - ESA 2002, Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 2461, Springer, Berlin, 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. J.K. Lenstra & A.H.G. Rinnooy Kan, "Complexity of scheduling under precedence constraints", Operations Research 26, 22-35, 1978.
14. F. Margot, M. Queyranne & Y. Wang, "Decompositions, network flows, and a precedence constrained single-machine scheduling problem", Operations Research 51, 981-992, 2003.
15. G.L. Nemhauser & L.E. Trotter, "Vertex packing: Structural properties and algorithms", Mathematical Programming 8, 232-248, 1978.
16. J.C. Picard, "Maximum closure of a graph and applications to combinatorial problems", Management Science 22, 1268-1272, 1976.
17. C.N. Potts, "An algorithm for the single machine sequencing problem with precedence constraints", Mathematical Programming Study 13, 78-87, 1980.
18. M. Queyranne, "Structure of a simple scheduling polyhedron", Mathematical Programming 58, 263-285, 1993.
19. M. Queyranne & A.S. Schulz, "Polyhedral approaches to machine scheduling", Technical Report 408, Department of Mathematics, Technische Universität Berlin, Germany, 1994.
20. M. Queyranne & Y. Wang, "Single-machine scheduling polyhedra with precedence constraints", Mathematics of Operations Research 16, 1-20, 1991.
21. A.S. Schulz, "Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds", W.H. Cunningham, S.T. McCormick, M. Queyranne (eds.), Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science 1084, Springer, Berlin, 301-315, 1996.
22. J.B. Sidney, "Decomposition algorithms for single machine scheduling with precedence relations and deferral costs", Operations Research 23, 283-298, 1975.
23. W.E. Smith, "Various optimizers for single-stage production", Naval Research and Logistics Quarterly 3, 59-66, 1956.
24. G.J. Woeginer, "On the approximability of average completion time scheduling under precedence constraints", Discrete Applied Mathematics 131, 237-252, 2003.
25. L.A. Wolsey, "Mixed integer programming formulations for production planning and scheduling problems", invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge, MA, 1985.
26. L.A. Wolsey, "Formulating single machine scheduling problems with precedence constraints", Economic Decision-Making: Games, Econometrics and Optimisation, J.J. Gabszewic, J.F. Richard, L.A. Wolsey (eds.), North-Holland, Amsterdam, 1990, pp 773-484.