Back to search
Clemson University
The Steiner Linear Ordering Problem: Application to resource-constrained scheduling problems
Abstract
dc:description.abstractWhen 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Magagnotti, Mariah
- Contributors dc:contributor
-
- Kerivin, Herv L. M.
- Shier , Doug
- Saltzman , Matthew
Subjects
dc:subject × 7Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_theses/811