Discrete Time Analysis of a Shut Down Queueing Systems

摘要

The purpose of this study is to analyze a special type of job shop queueing system which has the following features: 1) A finite number of customers is present initially and no new customers arrive; 2) there are two service stations, each with its own input and each serving the output of the other; and 3) as soon as a customer is served by both stations, he leaves the system. A queueing system with these features is called a shutdown queueing system and it may also be called a clearance problem. Queueing problems of this type arise in connection with fuel and supply facilities for aircraft. A fixed number of aircraft are scheduled for fueling and supply loading. Keywords: Computations; Exponential distributions. (kr)