Single-machine scheduling with precedence constraints

Mathematics of Operations Research

Volumn 30, Issue 4, 2005, Pages 1005-1021

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

^a UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; Integer programming formulation; Linear ordering; Linear programming relaxation; Partial order; Scheduling; Vertex cover

Indexed keywords

APPROXIMATION ALGORITHM; INTEGER PROGRAMMING FORMULATION; LINEAR ORDERING; LINEAR PROGRAMMING RELAXATION; PARTIAL ORDER; VERTEX COVER;

ALGORITHMS; APPROXIMATION THEORY; MACHINE COMPONENTS; OPERATIONS RESEARCH; SCHEDULING;

MATHEMATICAL PROGRAMMING;

EID: 31144479402     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1050.0158     Document Type: Article

References (36)

1. Balas, E. 1985. On the facial structure of scheduling polyhedra. Math. Programming Stud. 24 179-218.
2. Balinski, M. 1970. On a selection problem. Management Sci. 17 230-231.
3. Chang, G. J., J. Edmonds. 1985. The poset scheduling problem. Order 2 113-118.
4. Chekuri, C., R. Motwani. 1999. Precedence constrained scheduling to minimize sum of weighted completion time on a single machine. Discrete Appl. Math. 98 29-38.
5. Chudak, F. A., D. S. Hochbaum. 1999. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25 199-204.
6. Dushnik, B., E. W. Miller. 1941. Partially ordered sets. Amer. J. Math. 63 600-610.
7. Dyer, M. E., L. A. Wolsey. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26 255-270.
8. Eastman, W. L., S. Even, I. Isaacs. 1964. Bounds for the optimal scheduling of n jobs on m processors. Management Sci. 11 268-279.
9. Goemans, M. X., D. P. Williamson. 2000. Two-dimensional Gantt charts and a scheduling algorithm of Lawler. SIAM J. Discrete Math. 13 281-294.
10. Graham, R. L., E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 287-326.
11. Hall, L. A., D. B. Shmoys, J. Wein. 1996. Scheduling to minimize average completion time: Off-line and on-line algorithms. Proc. 7th Annual ACM-SIAM Sympos. on Discrete Algorithms, Atlanta, GA. SIAM, Philadelphia, PA, 142-151.
12. Hall, L. A., A. S. Schulz, D. B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22 513-544.
13. Hochbaum, D. S. 1983. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Appl. Math. 6 243-254.
14. Kolliopoulos, S. G., G. Steiner. 2002. Partially-ordered knapsack and applications to scheduling. R. H. Möhring, R. Raman, eds. Algorithms-ESA 2002, Vol. 2461. Lecture Notes in Computer Science. Springer, Heidelberg, Germany, 612-624.
15. Lawler, E. L. 1978. Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete. Math. 2 75-90.
16. Lenstra, J. K., A. H. G. Rinnooy Kan. 1978. Complexity of scheduling under precedence constraints. Oper. Res. 26 22-35.
17. Margot, F., M. Queyranne, Y. Wang. 2003. Decompositions, network flows, and a precedence constrained single-machine scheduling problem. Oper. Res. 51 981-992.
18. Möhring, R. H. 1989. Computationally tractable classes of ordered sets. I. Rival, ed. Algorithms and Order, Kluwer Academic, Dordrecht, The Netherlands, 105-193.
19. Nemhauser, G. L., L. E. Trotter, Jr. 1974. Properties of vertex packing and independence system polyhedra. Math. Programming 6 48-61.
20. Nemhauser, G. L., L. E. Trotter, Jr. 1975. Vertex packing: Structural properties and algorithms. Math. Programming 8 232-248.
21. Ore, O. 1962. Theory of Graphs, Vol. XXXVIII, Colloquium Publications. American Mathematical Society, Providence, RI.
22. Picard, J.-C. 1976. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22 1268-1272.
23. Picard, J.-C., M. Queyranne. 1980. On the structure of all minimum cuts in a network and applications. Math. Programming Stud. 13 8-16.
24. Pnueli, A., A. Lempel, S. Even. 1971. Transitive orientation of graphs and identification of permutation graphs. Canadian J. Math. 23 160-175.
25. Potts, C. N. 1980. An algorithm for the single machine sequencing problem with precedence constraints. Math. Programming Stud. 13 78-87.
26. Queyranne, M. 1993. Structure of a simple scheduling polyhedron. Math. Programming 58 263-285.
27. Queyranne, M., A. S. Schulz. 1994. Polyhedral approaches to machine scheduling. Technical report 408/1994, Department of Mathematics, Technische Universität Berlin, Berlin, Germany.
28. Queyranne, M., Y. Wang. 1991. Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16 1-20.
29. Rhys, J. M. W. 1970. A selection problem of shared fixed costs and network flows. Management Sci. 17 200-207.
30. Schulz, A. S. 1996. 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. Integer Programming and Combinatorial Optimization, Vol. 1084. Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 301-315.
31. Schulz, A. S., M. Skutella. 1997. Random-based scheduling: New approximations and LP lower bounds. J. D. P. Rolim, ed. Randomization and Approximation Techniques in Computer Science, Vol. 1269. Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 119-133.
32. Sidney, J. B. 1975. Decomposition algorithms for single machine scheduling with precedence relations and deferral costs. Oper: Res. 23 283-298.
33. Smith, W. E. 1956. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
34. Woeginger, G. J. 2003. On the approximability of average completion time scheduling under precedence constraints. Discrete Appl. Math. 131 237-252.
35. Wolsey, L. A. 1985. Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th Internat. Sympos. Math. Programming, MIT, Cambridge, MA.
36. Wolsey, L. A. 1990. Formulating single machine scheduling problems with precedence constraints. J. J. Gabszewicz, J. F. Richard, L. A. Wolsey, eds. Economic Decision-Making: Games, Econometrics and Optimisation, North-Holland, Amsterdam, The Netherlands, 473-484.