Article ID: | iaor20073271 |
Country: | United States |
Volume: | 51 |
Issue: | 6 |
Start Page Number: | 981 |
End Page Number: | 992 |
Publication Date: | Nov 2003 |
Journal: | Operations Research |
Authors: | Queyranne Maurice, Margot Franois, Wang Yaoguang |
Keywords: | networks: flow, programming: integer |
We present an in-depth theoretical, algorithmic, and computational study of a linear programming (LP) relaxation to the precedence constrained single-machine scheduling problem 1|prec|