Results 251 to 260 of about 2,185,055 (279)
Some of the next articles are maybe not open access.

A Queueing Model with Multiple Types of Server Breakdowns

Quality Technology & Quantitative Management, 2004
AbstractIn this paper we consider a general queueing model in which the server may experience several different types of breakdowns. Each type of breakdown requires a finite random number of stages of repair. We obtain a necessary and sufficient condition for the stationary queue length distribution to exist.
William J. Gray   +2 more
openaire   +1 more source

A Markovian Queue with N Servers Subject to Breakdowns and Repairs

Management Science, 1979
We study a queue with N servers, who may break down and require repair at a facility, which has c repair crews. Under exponential assumptions, this model has an algorithmically tractable solution. It is then in fact a particular case of the M/M/N queue in a Markovian environment. The purpose of this paper is twofold.
Marcel F. Neuts, David M. Lucantoni
openaire   +1 more source

Reliability Analysis of the MAP/M/c Queue with Server Breakdowns

Journal of Convergence Information Technology, 2010
We consider the MAP/M/c queue with markovian flow of breakdowns. There are K waiting positions for arrival customers in the system. The system we consider comprises c servers, of which one are has to work for the customers. The other servers is in the cold standby , repairing or waiting for repairing, only the working server can fails, and there is ...
Zonghao Zhou, Yijuan Zhu
openaire   +2 more sources

A single server Markovian differentiated working vacation queue with server breakdown

International Journal of Mathematics in Operational Research, 2022
V. Karthick   +2 more
openaire   +1 more source

Recursive solution technique in a multi-server bi-level queueing system with server breakdowns

IEEE Transactions on Reliability, 1989
This paper presents a multi-server, first-come, first-served queueing system that alternates between two modes of system operation. In one mode all s servers are available and in the other mode, only s-1 servers are available for serving the customers. This is due to breakdown of one of the servers.
Alam, Mansoor, Mani, V.
openaire   +1 more source

A DISCRETE-TIME Geo/G/1 RETRIAL QUEUE WITH SERVER BREAKDOWNS

Asia-Pacific Journal of Operational Research, 2006
This paper discusses a discrete-time Geo/G/1 retrial queue with the server subject to breakdowns and repairs. The customer just being served before server breakdown completes his remaining service when the server is fixed. The server lifetimes are assumed to be geometrical and the server repair times are arbitrarily distributed.
Iván Atencia, Pilar Moreno
openaire   +3 more sources

A Queueing Model with Balking, Server Vacation and Working Breakdown

International Journal of Mathematics in Operational Research, 2023
Kamlesh Kumar 0003, Madhu Jain
openaire   +1 more source

Structural Perturbation Analysis of a Single Server Queue with Breakdowns

Stochastic Models, 2010
This paper studies perturbations of the single server queue with breakdowns, where the perturbations consist of introducing dependent breakdowns. Problems that are modeled by queueing models with breakdowns and repairs are often very complicated, and they are resolved only through approximations.
Karim Abbas, Djamil Aïssani
openaire   +1 more source

A REVIEW ON BULK QUEUE WITH SERVER BREAKDOWN MODELS

This review article presents an overview of bulk arrival and bulk service with breakdown QM’s. The concept of bulk arrivals and bulk service has a new significance in the world of reality. To prevent the problem of traffic congestion, researchers must concentrate their efforts on developing models and processes to address the issue.
Rani, R., Indhira, K.
openaire   +1 more source

Repairable single server systems with multiple breakdown modes

Microelectronics Reliability, 1995
Abstract Typically the availability, steady-state queue length distribution, and mean queue length of Markov queueing systems subject to random breakdowns are computed by generating function or matrix geometric numerical methods. In this paper we point out that, for single server systems, a simple partition balance approach is easier.
Yi-Chih Hsieh, Mark S. Andersland
openaire   +1 more source

Home - About - Disclaimer - Privacy