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 only one repairman. This model is quite genera...

An alternative analysis of the classical M/G/1 cyclic order polling model is presented. We introduce the new Markov regenerative process framework, which provides a way to perform the analysis of the polling model on a unified, i.e. service discipline independent way. We derive the decomposition property and the general expressions of the stationary number of customers as well as the stationary...

We consider the pricing problem faced by a monopolist who sells a product to a population of consumers over a finite time horizon. Customers are heterogeneous along two dimensions: (i) willingness-to-pay for the product and (ii) arrival time during the selling season. We assume that the seller knows only the support of the customers’ valuations and do not make any other distributional assumptio...

This paper explored the future behavior of railway system, using Monte Carlo Simulation techniques, where find out and to reduce the customer waiting time and also ensure to provide the better service to the customers .Hence this studies revealed and fulfilled the customer needs and expectations and also maintaining the customer satisfaction level. This study based on the arrival and service pa...

The mathematical model of the retrial queuing system \(M^{[n]}/M/1\) with feedback and batch Poisson arrival is constructed. Customers arrive in groups. If server free, one arriving customers starts his service, rest join orbit. service times are exponentially distributed. customer whose completed leaves system, or reservice, goes to method asymptotic diffusion analysis proposed for finding pro...

In (his paper^-we^consider;an M/G/k queuelng model having finite capacity N . That Is, a model In which customers, arriving In accordance with a Polsson process having rate ■h > , enter the system If there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G . Upon entering, a customer will either Immediately enter s...

In this paper we analyse the renal transplant waiting list of the País Valencià in Spain, using Queueing theory. The customers of this queue are patients with end-stage renal failure waiting for a kidney transplant. We set up a simplified model to represent the flow of the customers through the system, and perform Bayesian inference to estimate parameters in the model. Finally, we consider seve...

In this paper, we consider a single server queueing system in which the arrivals occur according to Markovian arrival process (MAP). The served customers may be recruited (or opted from those customers’ point of view) act as secondary servers provide services waiting customers. Such who are referred servers. service times main well that assumed exponentially distributed possibly with different ...