hendrixson

This thesis analyzes a multi-class M/G/1 priority queueing system in which distinct job types require one service cycle and, with non-zero probability, require a second service cycle. The main objective is to find a new heuristic scheduling policy that minimizes the long-run expected holding and preemption costs. Arrival rates, service rates, and the probability of undertaking second service are all class specific. A mean value analysis (MVA) approach was employed to derive the long-run mean time in queue for each job type under each policy, thereby providing the appropriate cost equations. Numerical experiments suggest that the preemptive resume scheduling policy yields the lowest cost most frequently.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.

This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.