In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server’s status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to a Poisson...
In this paper we consider a like-queue production system in which server startup
and breakdowns are possible. The server is turned on ( begins startup)
when units are accumulated in the system and off when the system is empty.
We model this system by an M/M/1 queue with
server breakdowns and startup time under the policy. The arrival rate varies according to the server's status:
off, startup, busy, or breakdown.
While the server is working, he is subject to
breakdowns according to a Poisson process....
This paper considers an M/M/R/N queue with heterogeneous servers in which customers balk (do not enter) with a constant probability . We develop the maximum likelihood estimates of the parameters for the M/M/R/N queue with balking and heterogeneous servers. This is a generalization of the M/M/2 queue with heterogeneous servers (without balking), and the M/M/2/N queue with balking and heterogeneous servers in the literature. We also develop the confidence interval formula for the parameter , the...
This paper considers an M/M/R/N queue with heterogeneous
servers in which customers balk (do not enter) with a constant
probability (1 - . We develop the maximum likelihood
estimates of the parameters for the M/M/R/N queue with balking and
heterogeneous servers. This is a generalization of the M/M/2
queue with heterogeneous servers (without balking), and the
M/M/2/N queue with balking and heterogeneous servers in the
literature. We also develop the confidence interval formula for
the parameter...
This paper studies the machine repair
problem consisting of operating machines with spare
machines, and servers (repairmen) who leave for a vacation of
random length when there are no failed machines queuing up for
repair in the repair facility. At the end of the vacation the
servers return to the repair facility and operate one of three
vacation policies: single vacation, multiple vacation, and hybrid
single/multiple vacation. The Markov process and the
matrix-geometric approach are used to...
Download Results (CSV)