首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the M/G/1 queue with feedback and optional server vacations based on a single vacation policy
Authors:Kailash C Madan  Mohammad Al-Rawwash  
Institution:a College of Mathematical Sciences and Information Technology, Ahlia University, Kingdom of Bahrain, Manama, Bahrain;b Department of Statistics, Faculty of Science, Yarmouk University, Irbid, Jordan
Abstract:We study a single server queue with batch arrivals and general (arbitrary) service time distribution. The server provides service to customers, one by one, on a first come, first served basis. Just after completion of his service, a customer may leave the system or may opt to repeat his service, in which case this customer rejoins the queue. Further, just after completion of a customer's service the server may take a vacation of random length or may opt to continue staying in the system to serve the next customer. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers and the average waiting time in the queue. Some special cases of interest are discussed and some known results have been derived. A numerical illustration is provided.
Keywords:Batch arrivals in a compound Poisson process  General (arbitrary) service  Optional re-service  Steady state queue size distribution  Average queue size  Average waiting time
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号