Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

@article{Hardin2008StrongVI,
  title={Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements},
  author={Jill R. Hardin and George L. Nemhauser and Martin W. P. Savelsbergh},
  journal={Discrete Optimization},
  year={2008},
  volume={5},
  pages={19-35}
}
We consider the resource-constrained scheduling problem when each job’s resource requirements remain constant over its processing time. We study a time-indexed formulation of the problem, providing facet-defining inequalities for a projection of the resulting polyhedron that exploit the resource limitations inherent in the problem. Lifting procedures are then provided for obtaining strong valid inequalities for the original polyhedron. Computational results are presented to demonstrate the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…