Skip to main content
Conference Proceedings

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) (1996) 1084 288-300
DOI: 10.1007/3-540-61310-2_22
34Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the scheduling problem of minimizing a weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this relaxation is precisely the projection of a time-indexed relaxation introduced by Dyer and Wolsey.

Cite

CITATION STYLE

APA

Goemans, M. X. (1996). A supermodular relaxation for scheduling with release dates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1084, pp. 288–300). Springer Verlag. https://doi.org/10.1007/3-540-61310-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free