Article ID Journal Published Year Pages File Type
1142085 Operations Research Letters 2015 5 Pages PDF
Abstract

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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Valid inequalities for a time-indexed formulation
Authors
, ,