Date of Award

5-2010

Document Type

Thesis

Degree Name

Master of Science (MS)

Legacy Department

Mathematical Science

Advisor

Kerivin, Herv L. M.

Committee Member

Shier , Doug

Committee Member

Saltzman , Matthew

Abstract

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.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.