The objective of this research is to produce a set of tables for practitioner use for a selected set of queuing configurations. The tables that distinguish this research from previous studies are the mixed queue configurations; other tables are included for comparison and reference. The mixed queue configurations belong to a class of problems known as Lane Switching models. The goal for switching lanes applied to this research is to equalize the workload between two servers. All tables are presented in a unique manner in order to facilitate their application; this presentation is defined by the algorithm used to populate the tables with various combinations of exogenous variables. The tables are used in two actual and one hypothetical application to demonstrate their value in a variety of situations. Each application focuses on a different performance metric to evaluate implementation options. Each case emphasizes the complexities involved in queuing problems, which are multivariable functions.
|Advisor:||Hassan, Zia, Thomopoulos, Nick|
|School:||Illinois Institute of Technology|
|School Location:||United States -- Illinois|
|Source:||DAI-B 71/08, Dissertation Abstracts International|
|Keywords:||Lane switching, Queuing theory|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be