The Steiner Linear Ordering Problem: Application to resource-constrained scheduling problems

When examined through polyhedral study, the resource-constrained scheduling problems have always dealt with processes which have the same priority. With the Steiner Linear Ordering problem, we can address systems where the elements involved have different levels of priority, either high or low. This allows us greater flexibility in modeling different resource-constrained scheduling problems. In this paper, we address both the linear ordering problem and its application to scheduling problems, and provide a polyhedral study of the associated polytopes