Valid inequalities for a time-indexed formulation
2015
We present a general time-indexed formulation that contains scheduling problems with unrelated parallel machines. We derive a class of basic valid inequalities for this formulation, and we show that a subset of these inequalities are facet-defining. We characterize all facet-defining inequalities with right-hand side 1. Further, we show how to efficiently separate these inequalities.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
16
References
2
Citations
NaN
KQI