The Experts below are selected from a list of 141 Experts worldwide ranked by ideXlab platform
Masakiyo Miyazawa - One of the best experts on this subject based on the ideXlab platform.
-
On the System Queue length distributions of LCFS-P Queues with arbitrary acceptance and restarting policies
Journal of Applied Probability, 1992Co-Authors: Masakiyo MiyazawaAbstract:Shanthikumar and Sumita (1986) proved that the stationary System Queue length distribution just after a departure instant is geometric for GI / GI /1 with LCFS-P/H service discipline and with a constant acceptance probability of an arriving customer, where P denotes preemptive and H is a restarting policy which may depend on the history of preemption. They also got interesting relationships among characteristics. We generalize those results for G / G/ 1 with an arbitrary restarting LCFS-P and with an arbitrary acceptance policy. Several corollaries are obtained. Fakinos' (1987) and Yamazaki's (1990) expressions for the System Queue length distribution are extended. For a Poisson arrival case, we extend the well-known insensitivity for LCFS-P/resume, and discuss the stationary distribution for LCFS-P/repeat.
P. Vijaya Laxmi - One of the best experts on this subject based on the ideXlab platform.
-
A renewal input single and batch service Queues with accessibility to batches
International Journal of Management Science and Engineering Management, 2011Co-Authors: Veena Goswami, P. Vijaya LaxmiAbstract:Abstract This paper presents a renewal input single and batch service infinite (finite) buffer Queueing System with accessibility to the batches. The inter-arrival times of successive arrivals are assumed to be independent and arbitrarily distributed. The customers are served by a single-server either one at a time or in batches with accessibility to the batches depending upon the number of customers present in the System. The service times are assumed to be independent and exponentially distributed. We present a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining inter-arrival time, to obtain the steady-state probability distribution of the number of customers in the System/Queue. A cost model is developed to determine the optimum service rates which minimizes the total expected cost for assumed numerical values of System parameters. Various performance measures are provided based on this analysis.
-
Finite buffer renewal input multiple exponential vacations Queue with accessible and non-accessible batches
International Journal of Management Science and Engineering Management, 2010Co-Authors: P. Vijaya Laxmi, Veena Goswami, Obsie Mussa YesufAbstract:Abstract In this paper, we study a finite buffer single server accessible and non-accessible batch service Queue with multiple exponential vacations. The inter-arrival and service times are, respectively, arbitrarily and exponentially distributed. Using the supplementary variable technique (SVT) and the embedded Markov chain technique (EMCT), we obtain the steady state System (Queue) length distributions at pre-arrival and arbitrary epochs. Some numerical results are presented in the form of table and graphs.
Leon F Mcginnis - One of the best experts on this subject based on the ideXlab platform.
-
performance evaluation for general Queueing networks in manufacturing Systems characterizing the trade off between Queue time and utilization
European Journal of Operational Research, 2012Co-Authors: Kan Wu, Leon F McginnisAbstract:Performance evaluation plays a key role in manufacturing System design and productivity improvement. Characterizing performance objectively is the first step. Inspired by the underlying structure of tandem Queues, we have derived an approximate model to characterize the System performance. The model decomposes System Queue time and variability into bottleneck and non-bottleneck parts while capturing the dependence among workstations. Compared the new model with prior approaches, the new model not only is more accurate but also requires less information. The property of manufacturing System performance is given based on the insight from the model.
Ashwini Yerlekar - One of the best experts on this subject based on the ideXlab platform.
-
A Survey on Patient Queue Management System
International Journal of Advanced Engineering Management and Science, 2018Co-Authors: Neha Titarmare, Ashwini YerlekarAbstract:In this paper, we study the various types of Queue and Queue Management System. Queue System can successfully reduce waiting time of the patients in the hospitals. We aim to implement a model that initializes alert notification via SMS to patients of a hospital. It will minimize the Queue of patients in the waiting area of hospital and also patient can book an appointment from anywhere at a given time. Patients can book an appointment via android application. and accordingly patients and also it will provide navigation towards that nearest hospital. Hence, for developing such a model a survey has been done on various types of Queues.
A. Banerjee - One of the best experts on this subject based on the ideXlab platform.
-
Steady state analysis of System size-based balking in M / M b /1 Queue
International Journal of Mathematics in Operational Research, 2019Co-Authors: G.k. Gupta, A. BanerjeeAbstract:In this paper we consider a single server Poisson Queue where customers are served in batches of fixed size. The inter arrival time and the service time are considered to be exponentially distributed. The customers upon arrival may decide to join the System or not to join the System by observing the System length. They may join or balk the System with certain probability. Using probability generating function method we obtain the closed form expression for steady state Queue length distribution, expected System (Queue) length and expected waiting time of a customer in the System (Queue). Finally, several numerical results are discussed in the form of table and graphs to explore the sensitivity of System parameters on key performance measures.
-
M/M/1 machine repairmanproblem withbulk-repair using general bulk service rule
International Journal of Mathematics and Statistics, 2014Co-Authors: A. Banerjee, U. C. GuptaAbstract:In this paper, we consider a M/M/1//N machine repairman problem where the failed machines are repaired in batches of minimum size ‘a’ with a maximum threshold value ‘b’. We obtain several probability distributions of interest, such as, the joint distribution of the number of down machines in the Queue and with the repairman, the distribution of the number of the down machines in the Queue, number of the machines under repair with the repairman, and thenumberofworking machines.Various useful performance measures, such as,average System (Queue) length,averagewaiting timeofafailed machinein the Queue as well as in the System, average number of operating machines, probability that the repairman is idle, have been obtained. Finally, influence of certain model parameters on keyperformence measureshave beeninvestigated.
-
analysis of finite buffer bulk arrival bulk service Queue with variable service capacity and batch size dependent service m x g y r 1 n
International Journal of Mathematics in Operational Research, 2013Co-Authors: A. Banerjee, U. C. Gupta, K SikdarAbstract:Over the past few decades, bulk-arrival bulk-service Queues have found wide application in several areas including computer-communication and telecommunication Systems. In this paper, we consider a single server finite-buffer Queue where customers arrive in batches according to the compound Poisson process and are served in batches of variable service capacity. The service times of the batches are arbitrarily distributed and depend on the size of the batch taken into for service. We obtain the joint distribution of the number of customers in the Queue and number with the server, and other distributions such as number of customers in the Queue, in the System, and number with the server. Various performance measures such as average number of customers in the System (Queue), with the server, blocking probabilities, etc. are obtained. Several numerical results are presented and comparative studies of batch-size-dependent service with the one when service time of the batches are independent of the size of the batch have been carried out.
