180 Hits in 6.3 sec

M/M/1 Retrial Queuing System with Loss and Feedback under Pre-Emptive Priority Service

G. Ayyappan, A.Muthu Ganapathi, Gopal Sekar
2010 International Journal of Computer Applications  
Consider a single server retrial queueing system with loss and feedback under Non-pre-emptive priority service in which two types of customers arrive in a Poisson process with arrival rate λ 1 for low  ...  in the queue(MPQL),Truncation level (OCUT),Probability of server free and Probabilities of server busy with low, high  ...  If the server is engaging with low priority customer and at that time the higher priority customer comes then the high priority customer will get service only after completion of the service of low priority  ... 
doi:10.5120/672-945 fatcat:m3nlwucwxjeajnbl2bpqlesodi

Analysis of Finite Buffer Markovian Queue with Balking, Reneging and Working Vacations

P. Vijaya Laxmi, V. Goswami, K. Jyothsna
2013 International Journal of Strategic Decision Sciences  
This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations.  ...  The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution.  ...  Servi and Finn (2002) introduced the concept of multiple working vacations with the study of M/M/1/WV queue. Wu and Takagi (2006) generalized the M/M/1/WV queue to an M/G/1/WV queue.  ... 
doi:10.4018/jsds.2013010101 fatcat:dzaold36vjecbinjmeg2v3ij6u


Vahid Sarhangian, Bariş Balciog̃lu
2013 Probability in the engineering and informational sciences (Print)  
Choi, Kim, and Chung [13] study the M/M/1 queue where high-priority customers have deterministic impatience time and have preemptive priority over patient low-priority customers.  ...  Short title: Multi-class Queues with Impatient Customers Hyperexponential random variable (r.v.) representing the time-to-abandon r.v. of the constructed single class of customers (see the end of Section  ...  Acknowledgements This work was supported in part by Natural Sciences and Engineering Research Council (NSERC) of Canada.  ... 
doi:10.1017/s0269964813000065 fatcat:xnisugd2nvbeliqiropx3wndcm

A Priority Queue with Many Customer Types, Correlated Arrivals and Changing Priorities

Seokjun Lee, Sergei Dudin, Olga Dudina, Chesoong Kim, Valentina Klimenok
2020 Mathematics  
A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed.  ...  The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is described by a multi-dimensional Markov chain.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/math8081292 fatcat:d4iamkzijfb23l4d3mwbu7qpgq

Joint queue length distribution of multi-class, single-server queues with preemptive priorities

Andrei Sleptchenko, Jori Selen, Ivo Adan, Geert-Jan van Houtum
2015 Queueing systems  
In this paper we analyze an M/M/1 queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes.  ...  We conclude by briefly indicating how the method can be extended to an M/M/1 queueing system with non-preemptive priorities between customer classes.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution  ... 
doi:10.1007/s11134-015-9460-z fatcat:ds6oqyp2l5d5zp42x6oqd6utli

Stationary Delays for a Two-Class Priority Queue With Impatient Customers

Oualid Jouini, Yves Dallery
2007 Proceedings of the 2nd International ICST Conference on Performance Evaluation Methodologies and Tools  
We consider a Markovian multiserver queue with two types of impatient customers, high and low priority ones. The first type of customers has a non-preemptive strict priority over the other type.  ...  We focus on deriving performance measures in terms of the sojourn times of customers in queue, either before starting service, or before reneging.  ...  We refer the reader to [7] , where the authors derived several performance measures for an M/M/1 queue with two classes of impatient customers in which class 1 customers have impatience of constant duration  ... 
doi:10.4108/valuetools.2007.2001 dblp:conf/valuetools/JouiniD07 fatcat:t3bbtwwsl5b2fn4mgp4yxthnju

Queue systems with balking : a stochastic model of price discrimination

Ernest Koenigsberg
1985 Reserche operationelle  
MULTIPLE CUSTOMER CLASSES We consider queueing Systems with M classes of customers in which a customer with lower class index m is more impatient than all customers with higher index m' (m = 1, 2, . .  ...  QUEUE SYSTEMS WITH BALKING (a) Priority Systems We consider a queueing system with M classes of customers where a customer with lower index m has priority for service over all customers with higher index  ...  QUEUE SYSTEMS WITH BALKING 219 particular, the utility function of the buyer is composed of préférences with respect to both price and quality of service.  ... 
doi:10.1051/ro/1985190302091 fatcat:hq5o6wekmveu5nz6jyboy7txua

Case Study for Shuruchi Restaurant Queuing Model

Md. Al-Amin Molla
2017 IOSR Journal of Business and Management  
We have also determined the probability of impatient customers to ignore the system.  ...  Using Little's theorem and the single channel waiting line model M/M/1.  ...  M/M/1 queuing model the following variables will be investigated [schematic representation of M/M/1 queuing system  Ls Increases if  or W s increases.   Increases if Ls increases or W s decreases  ... 
doi:10.9790/487x-1902039398 fatcat:ymt6zl5cwzbehortbmob6ie2ou

On Two Priority Multi-Server Queues with Impatient Customers

Hung-Wei Li
2016 International Journal of Operations Research  
This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority.  ...  Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates.  ...  [3] analyzes M/M/1 queues with impatient customers of higher priority. Kao and Wilson [9] analyzed non-preemptive priority queues with multiple servers and two priority classes.  ... 
doaj:36e6d28abf4247b6a4363774a57ff3ea fatcat:65mbinszmff47gnpayeleia2w4

Analysis of a Constant Retrial Queue with Joining Strategy and Impatient Retrial Customers

Shan Gao, Xiangyang Niu, Tao Li
2017 Mathematical Problems in Engineering  
This paper treats an M/M/1 retrial queue with constant retrial times.  ...  Upon retrial, the customer immediately receives his service if the server is idle; otherwise, he may enter the orbit again or leave the system because of impatience.  ...  Conclusions This paper has first presented the performance analysis of an M/M/1 retrial queue with impatient customers.  ... 
doi:10.1155/2017/9618215 fatcat:kr2ulv7sqfeuxdefxhm5jahj4y

Page 5140 of Mathematical Reviews Vol. , Issue 2002G [page]

2002 Mathematical Reviews  
Siddiqui (1-COS-S; Fort Collins, CO) 2002g:60141 60K25 90B22 Choi, Bong Dae (KR-KOR; Seoul); Kim, Bara (KR-KOR; Seoul); Chung, Jinmin M/M/\ queue with impatient customers of higher priority.  ...  (English summary) Queueing Syst. Theory Appl. 38 (2001), no. 1, 49-66. The paper begins with an analysis of M/M/c FIFO queues in which all customers are impatient.  ... 

Queues with slow servers and impatient customers

Nir Perel, Uri Yechiali
2010 European Journal of Operational Research  
We study M=M=c queues (c ¼ 1, 1 < c < 1 and c ¼ 1Þ in a 2-phase (fast and slow) Markovian random environment, with impatient customers.  ...  When in the slow phase, customers become impatient. That is, each customer, upon arrival, activates an individual timer, exponentially distributed with parameter n.  ...  We also calculated the mean total number of customers in the system. In the M=M=1 and M=M=c (c < 1Þ queues we solved a differential equation in order to derive the PGFs.  ... 
doi:10.1016/j.ejor.2009.02.024 fatcat:fzly6mhzerelfg3uz7b7rzsnyi

On multiple priority multi-server queues with impatience

O Jouini, A Roubos
2014 Journal of the Operational Research Society  
We consider Markovian multi-server queues with two types of impatient customers: highand low-priority ones. The first type of customers has a non-preemptive priority over the other type.  ...  The analysis we develop holds also for a priority queue with mixed policies, i.e., FCFS for the first type and LCFS for the second one, and vice versa.  ...  We refer the reader to Choi et al. (2001) , where the authors derive several performance measures for an M/M/1 queue with two types of impatient customers in which type 1 customers have impatience of  ... 
doi:10.1057/jors.2012.153 fatcat:aex2ln2g2vbslbyfy3zqoob6cq

Applications of queues in hospitals in Istanbul

Dr. Imran Aslan
2015 Journal of Social Sciences (COES&RJ-JSS)  
Patient categorization based on appointments such as scheduled patients, checking patients, urgent patients, priority patients and new patients of day, serving different patients at district time of day  ...  Applications of queues in hospitals in Istanbul In healthcare, M / M / s / ∞/ FCFS model can be applicable since the doctors are mainly limited and there are different patients having taken queue from  ...  Case Study 5: M/M/1-M/M/1(c)/k Tandem Queues Patients come to the hospital with λ to a special department.  ... 
doi:10.25255/jss.2015.4.2.770.794 fatcat:c7sjxcug7fbvfojvvg5yce5t4u

Implementation of Fuzzy Logic for M/M/C Model in Packet Switched Network Using HoL Priority Queue

Sampath Kumar. K, R. Jahir Hussain
2019 International Journal of Research in Advent Technology  
In this paper, an HoL priority queue is utilised to give preference to some high priority traffic using fuzzy logic controller.  ...  The same controller is also used to choose the number of servers in M/M/C queue model since this represents the speed of service.  ...  When the model used is M/M/1, the length of the queue has to be high to compensate lots of people.  ... 
doi:10.32622/ijrat.71201997 fatcat:luugssl5bbaq7i6mdqh5p7vpdm
« Previous Showing results 1 — 15 out of 180 results