Dissertation/Thesis Abstract

Scheduling of generalized Cambridge rings
by Bauer, Daniel Howard, Ph.D., The University of Texas at Austin, 2009, 186; 3372348
Abstract (Summary)

A Generalized Cambridge Ring is a queueing system that can be used as an approximate model of some material handling systems used in modern factories. It consists of one or more vehicles that carry cargo from origins to destinations around a loop, with queues forming when cargo temporarily exceeds the capacity of the system. For some Generalized Cambridge Rings that satisfy the usual traffic conditions for stability, it is demonstrated that some nonidling scheduling polices are unstable. A good scheduling policy will increase the efficiency of these systems by reducing waiting times and by therefore also reducing work in process (WIP). Simple heuristic policies are developed which provide substantial improvements over the commonly used first-in-first-out (FIFO) policy. Variances are incorporated into previously developed fluid models that used only means to produce a more accurate partially discrete fluid mean-variance model, which is used to further reduce waiting times. Optimal policies are obtained for some simple special cases, and simulations are used to compare policies in more general cases. The methods developed may be applicable to other queueing systems.

Indexing (document details)
Advisor: Hasenbein, John J.
Commitee: Barnes, Wesley, Morton, David P., Popova, Elmira, Shakkottai, Sanjay
School: The University of Texas at Austin
Department: Operations Research and Industrial Engineering
School Location: United States -- Texas
Source: DAI-B 70/09, Dissertation Abstracts International
Subjects: Industrial engineering, Mechanical engineering, Operations research
Keywords: Cambridge rings, Material handling systems, Multiclass, Queueing, Scheduling
Publication Number: 3372348
ISBN: 9781109352900
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy