Optimum cost analysis for an Geo/Geo/c/N feedback queue under synchronous working vacations and impatient customers

This paper concerns the cost optimisation analysis of a discrete-time finite-capacity multiserver queueing system with Bernoulli feedback, synchronous multiple and single working vacations, balking, and reneging during both busy and working vacation periods. A reneged customer can be retained in the system by employing certain persuasive mechanism for completion of service. Using recursive method, the explicit expressions for the stationary state probabilities are obtained. Various system performance measures are presented. Further, a cost model is formulated. Then, the optimization of the model is carried out using quadratic fit search method (QFSM). Finally, the impact of various system parameters on the performance measures of the queueing system is shown numerically.</p

Optimization of renewal input (a, c, b) policy working vacation queue with change over time and bernoulli schedule vacation interruption

This paper presents a renewal input single working vacation queue with change over time and Bernoulli schedule vacation interruption under (a, c, b) policy. The service and vacation times are exponentially distributed. The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a ≤ c ≤ b). The change over period follows if there are (a − 1) customers at service completion instants. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained. An optimal cost policy is presented along with few numerical experiences. The genetic algorithm and quadratic fit search method are employed to search for optimal values of some important parameters of the system.Publisher's Versio

STEADY-STATE ANALYSIS OF THE GI/M/1 QUEUE WITH MULTIPLE VACATIONS AND SET-UP TIME

In this paper, we consider a GI/M/1 queueing model with multiple vacations and set-up time. We derive the distribution and the generating function and the stochastic decomposition of the steady-state queue length, meanwhile, we get the waiting time distributions. Key words: multiple vacations, set-up time, stochastic decompositio

GI/Geom/1/N/MWV queue with changeover time and searching for the optimum service rate in working vacation period

AbstractIn this paper, we consider a finite buffer size discrete-time multiple working vacation queue with changeover time. Employing the supplementary variable and embedded Markov chain techniques, we derive the steady state system length distributions at different time epochs. Based on the various system length distributions, the blocking probability, probability mass function of sojourn time and other performance measures along with some numerical examples have been discussed. Then, we use the parabolic method to search the optimum value of the service rate in working vacation period under a given cost structure

M/M/1 Multiple Vacation Queueing Systems with Differentiated Vacations

We consider a multiple vacation queueing system in which a vacation following a busy period has a different distribution from a vacation that is taken without serving at least one customer. For ease of analysis it is assumed that the service times are exponentially distributed and the two vacation types are also exponentially distributed but with different means. The steady-state solution is obtained

Strategic queueing behavior for individual and social optimization in managing discrete time working vacation queue with Bernoulli interruption schedule

In this paper, we consider a discrete time working vacation queue with a utility function for the reward of receiving the service and the cost of waiting in the system. A more flexible switching mechanism between low and regular service states is introduced to enhance the practical value of the working vacation queue. Under different precision levels of the system information, namely observable, almost unobservable and fully unobservable cases, the utility function is studied from both the individual customer’s and the system administrator’s points of view. By analyzing the steady-state behavior of the system, the associated optimal joining decisions under different information scenarios are obtained. We find that for the fully observable queue, the joining threshold for individual optimization may be less than the one for social optimization in working vacation period. A similar situation also appears in almost unobservable case. Such phenomenon is not possible for the classic first come first served queue due to the fact that there is no vacation time and thus will not cause large fluctuations in customers’ conditional waiting time. Additionally, we also conduct some numerical comparisons to demonstrate the effect of the information levels as well as system parameters on customer joining behavior.This research was partially supported by grant from NSERC DAS programs, National Natural Science Foundation of China (Nos.71301111, 71571127, 71402072) and the FSUSE (No.2012RC23).http://www.elsevier.com/locate/caor2017-09-30hb2016Electrical, Electronic and Computer Engineerin