In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

In many congestion problems, the customers may not like to join a long queue and may balk. To reduce the balking behavior of the customers, the provision of additional servers can be made in such situations. In the present paper, we investigate a Markovian queueing model with balking, interdependent rates and additional servers under no passing constraint. Due to nopassing restriction, the cust...

in this paper we introduced a new priority rule algorithm in human queues. the suggested method is applicable in human lines with different demands (serving times) for different customers. in this method, the waiting time for each customer is related to the volume of demand. a common example of such a system is a bakery line. the usual priority rule algorithm in this kind of queue is first-in-f...

background different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in norway. in the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waiti...

The detailed study about its mathematical properties, estimation of parameter and application showing the superiority of Lindley distribution over exponential distribution for the waiting times before service of the bank customers has been done by Ghitany et al. [3]. The Lindley distribution has been generalized extended and modified by different researchers including [1,420] are some among oth...

We consider a heterogeneous queueing system consisting of one large pool of O(r) identical servers, where r → ∞ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in the distributional sense. The system is heavily loaded in the Halfin-Whitt sense, namely the nominal utilization is 1− a/ √ r where a > 0 is the spare capacity param...

This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...

We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

Many real-world situations involve queueing systems in which customers may abandon if service does not start sufficiently quickly. We study a comprehensive model of multi-class queue scheduling accounting for customer abandonment, with the objective of minimizing the total discounted or time-average sum of linear waiting costs, completion rewards and abandonment penalties of customers in the sy...