Document Type

Thesis

Date of Award

5-31-1991

Degree Name

Master of Science in Industrial Engineering - (M.S.)

Department

Mechanical and Industrial Engineering

First Advisor

Xiuli Chao

Second Advisor

Layek Abdel-Malek

Third Advisor

Golgen Bengu

Abstract

We study a single server queueing system with finite buffer, Poisson arrivals and exceptional service requirements for the first customer in each busy period. The system is studied as a Markov Chain and the limiting probability distributions are obtained. The explicit form sorution for the queue length distribution, blocking probability, waiting time distribution as well as the busy period are derived through the Laplace-Stieltjes transform method. These results are then applied to a tandem system with a finite buffer in front of the first station and no intermediate buffer between the two stations. Finally, similar results are obtained for the queueing system with batch poisson arrival processes.

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.