In this paper, we investigate the power management of mobile devices, using a variant of an M/G/1 queue with probabilistic inhomogeneous multiple vacations and generalized service process. Under the vacation scheme, at the end of a vacation the server goes on another vacation, with a different probability distribution, if during the previous vacation there have been no arrivals. The modified va...

The aim of this paper is to analyze Bi-level threshold policy of M/(G1, G2)/1 with single vacation (SV) queue in a fuzzy environment. A mathematical Non linear programming (NLP) method is used to construct the membership function of the system characteristic in which the batch arrival-rate, expected group size, setup time, vacation time, service time for first essential service(FES), service ti...

We consider a stationary multi-class FIFO M/G/1 queue with exponential working vacations, where a server works at two different processing rates. There are K classes of customers, and the arrival rates and the distributions of the amount of service requirements of arriving customers depend on both their customer classes and the server state. When the system becomes empty, the server takes a wor...

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already experienced at a queue, or a long wait anticipated by a customer upon arrival. In this paper we consider systems with servers vacations where customers’ impatience is due to an absentee of servers upon arrival. Such a model, repr...

This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed access to the server. We first present the necessary and sufficient c...

This paper investigate a queueing model where in customers arrive in batches according to compound Poisson process with rate λ and are served one by one in FIFO basis. All incoming customers demand the first ’essential’ service wherein only some of them demand the second ’optional’ service. The service times of both essential and optional services follow arbitrary(general)distribution with diff...

ABSTRACT We analyze a single server queue with modified Bernoulli server vacations based on exhaustive service. Unlike other vacation policies, we assume that only at the completion of service of the last customer in the system, the server has the option to take a vacation or to remain idle in the system waiting for the next customer to arrive. The service times of the customers have been assum...

In this paper, we investigate an M/M/c queue with single working vacations of partial servers and setup times. During the vacation period, some of which servers are not entirely stop the service but service the new customers at a lower service rate, the other servers have a normal vacation and stop the service. Quasi-birth-and-death-process and infinitesimal generators for the process are obtai...