A supermodular relaxation for scheduling with release dates

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

Volumn 1084, Issue , 1996, Pages 288-300

  Goemans, Michel X ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; SCHEDULING;

RELEASE DATE; SCHEDULING PROBLEM; SUPERMODULAR; WEIGHTED SUM;

INTEGER PROGRAMMING;

EID: 84947944584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_22     Document Type: Conference Paper

References (13)

1. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990).
2. 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).
3. S. Fujishige, "Submodular functions and optimization," Annals of Discrete Mathematics, 47, North-Holland (1991).
4. L.A. Hall, D.B. Shmoys and 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.
5. L. Lovász, "Submodular functions and convexity," in: A. Bachem, M. Grötschei andB. Korte (eds.), Mathematical Programming: The State of the Art, Bonn, 1982, Springer, Berlin, 235-257, 1983.
6. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York (1988).
7. G.L. Nemhauser, L.A. Wolsey and M.L. Fisher, "An analysis of approximations for maximizing submodular set functions-I," Mathematical Programing, 14, 265-294 (1978).
8. M.E. Posner, "A sequencing problem with release dates and clustered jobs," Management Science, 32, 731-738 (1986).
9. M. Queyranne, "Structure of a simple scheduling polyhedron," Mathematical Programming, 58, 263-285 (1993).
10. M. Queyranne and A. S. Schulz, "Polyhedral approaches to machine scheduling," Preprint 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1994.
11. M. Queyranne and A. S. Schulz, "Scheduling units jobs with compatible release dates on parallel machines with nonstationary speeds," Proceedings of the 4th Integer Programming and Combinatorial Optimization Conference, E. Balas and J. Clausen, eds., Lecture Notes in Computer Science, 920, Springer-Verlag, 307-320 (1995).
12. A.S. Schulz, "Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds," these proceedings, 1996.
13. L.S. Shapley, "Complements and substitutes in the optimal assignment problem," Naval Research Logistics Qualerly, 9, 45-48 (1962).