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


Single line queue with recurrent repeated demands
Authors:K Farahmand
Institution:(1) Department of Mathematics, University of Ulster, BT37 0QB Co. Antrim, Northern Ireland
Abstract:We analyze a model queueing system in which customers cannot be in continuous contact with the server, but must call in to request service. If the server is free, the customer enters service immediately, but if the server is occupied, the unsatisfied customer must break contact and reapply for service later. There are two types of customer present who may reapply. First transit customers who arrive from outside according to a Poisson process and if they find the server busy they join a source of unsatisfied customers, called the orbit, who according to an exponential distribution reapply for service till they find the server free and leave the system on completion of service. Secondly there are a number of recurrent customers present who reapply for service according to a different exponential distribution and immediately go back in to the orbit after each completion of service. We assume a general service time distribution and calculate several characterstic quantities of the system for both the constant rate of reapplying for service and for the case when customers are discouraged and reduce their rate of demand as more customers join the orbit.
Keywords:Single line queue  repeated demands  orbit size  waiting time  ergodic state  generating function  retrial queue  recurrent customer
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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