Optimal service of aging demands in a single-server system with variable service rate and payment for buffer place rent

2000 ◽  
Vol 36 (3) ◽  
pp. 437-441
Author(s):  
A. I. Ivaneshkin
2011 ◽  
Vol 2 (4) ◽  
pp. 75-88
Author(s):  
Veena Goswami ◽  
G. B. Mund

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.


Author(s):  
P. Vijaya Laxmi ◽  
Rajesh P.

This article analyzes an infinite buffer discrete-time single server queueing system with variant working vacations in which customers arrive according to a geometric process. As soon as the system becomes empty, the server takes working vacations. The server will take a maximum number K of working vacations until either he finds at least on customer in the queue or the server has exhaustively taken all the vacations. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. The probability generating function of the steady-state probabilities and the closed form expressions of the system size when the server is in different states have been derived. In addition, some other performance measures, their monotonicity with respect to K and a cost model are presented to determine the optimal service rate during working vacation.


Author(s):  
Veena Goswami ◽  
G. B. Mund

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.


1996 ◽  
Vol 32 (6) ◽  
pp. 837-845
Author(s):  
A. I. Ivaneshkin ◽  
A. V. Dorovskikh

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.


2007 ◽  
Vol 21 (3) ◽  
pp. 361-380 ◽  
Author(s):  
Refael Hassin

This article deals with the effect of information and uncertainty on profits in an unobservable single-server queuing system. We consider scenarios in which the service rate, the service quality, or the waiting conditions are random variables that are known to the server but not to the customers. We ask whether the server is motivated to reveal these parameters. We investigate the structure of the profit function and its sensitivity to the variance of the random variable. We consider and compare variations of the model according to whether the server can modify the service price after observing the realization of the random variable.


1993 ◽  
Vol 16 (6) ◽  
pp. 817-824 ◽  
Author(s):  
Ding‐Tsair Chang ◽  
Ue‐Pyng Wen ◽  
James T. Lin
Keyword(s):  

Author(s):  
Rami Atar ◽  
Amarjit Budhiraja ◽  
Paul Dupuis ◽  
Ruoyu Wu

For the M/M/1+M model at the law-of-large-numbers scale, the long-run reneging count per unit time does not depend on the individual (i.e., per customer) reneging rate. This paradoxical statement has a simple proof. Less obvious is a large deviations analogue of this fact, stated as follows: the decay rate of the probability that the long-run reneging count per unit time is atypically large or atypically small does not depend on the individual reneging rate. In this paper, the sample path large deviations principle for the model is proved and the rate function is computed. Next, large time asymptotics for the reneging rate are studied for the case when the arrival rate exceeds the service rate. The key ingredient is a calculus of variations analysis of the variational problem associated with atypical reneging. A characterization of the aforementioned decay rate, given explicitly in terms of the arrival and service rate parameters of the model, is provided yielding a precise mathematical description of this paradoxical behavior.


2018 ◽  
Vol 127-128 ◽  
pp. 1-20 ◽  
Author(s):  
Chesoong Kim ◽  
Sergei Dudin ◽  
Alexander Dudin ◽  
Konstantin Samouylov

Sign in / Sign up

Export Citation Format

Share Document