In this study, we investigate a single server architecture in which the customer service system is not aware of length line that was sent to them. Thus, system-controlling equations here become what are known as vacation differential equations. Here, argue specifically causing oscillations performance measurements system. The symbolic structure equation non-Markovian queuing problem introduced ...

SUMMARY. A simple series form is obtained for the transient state probabilities of a single server Markovian queue with finite waiting space whence all particular cases concerning infinite waiting space and steady-state situations can be derived straight away. Also the coefficients in the series satisfy iterative recurrence relations which enable fast and accurate numerical computations.

Setting signals at intersections to minimize the queue length and vehicle delay time is a key goal in traffic management. In this paper, a new control strategy for a signalized traffic intersection is developed by applying Markovian decision control theory. Statistical analysis of simulation results with different arrival rates indicate the excellent potential of this approach.

Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogenous, we demonstrate that the Shortest Qu...

Present investigation deals with optimal management policy for Markovian queue with server breakdowns, vacations and setup. The customers arrive in Poisson fashion to get the service. The server may breakdown during the service and goes for repair immediately. By applying probability generating function technique queue length distribution is obtain for different states of the server. Further we...

In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion o...