Analysis of a discrete-time queue with general service demands and phase-type service capacities

Abstract

In this paper, we analyze a non-classical discrete-time queueing model where customers demand variable amounts of work from a server that is able to perform this work at a varying rate. The service demands of the customers are integer numbers of work wilds. They are assumed to be independent and identically distributed (i.i.d.) random variables. The service capacities, i.e., the numbers of work units that the server can process in the consecutive slots, are also assumed to be i.i.d. and their common probability generating function (pgf) is assumed to be rational. New customers arrive in the queueing system according to a general independent arrival process. For this queueing model we present an analysis method, which is based on complex contour integration. Expressions are obtained for the pgfs, the mean values and the tail probabilities of the customer delay and the system content in steady state. The analysis is illustrated by means of some numerical examples

Artificial Bee Colony Algorithm for Solving Fuzzy Multi-Objective Bed Allocation Model

“…Lack in the number of beds or incorrect bed distribution can increase waiting times, patients' being in the wrong place and not trusting bed management [16,17]. Planning beds in an accurate way is important to satisfy patients' needs, arrange departments and develop the provided service as to quality and amount.…”