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


The last departure time from an M t /G/∞ queue with a terminating arrival process
Authors:David Alan Goldberg  Ward Whitt
Institution:(1) Operations Research Center, MIT, Cambridge, MA, USA;(2) IEOR Department, Columbia University, New York, NY, USA
Abstract:This paper studies the last departure time from a queue with a terminating arrival process. This problem is motivated by a model of two-stage inspection in which finitely many items come to a first stage for screening. Items failing first-stage inspection go to a second stage to be examined further. Assuming that arrivals at the second stage can be regarded as an independent thinning of the departures from the first stage, the arrival process at the second stage is approximately a terminating Poisson process. If the failure probabilities are not constant, then this Poisson process will be nonhomogeneous. The last departure time from an M t /G/∞ queue with a terminating arrival process serves as a remarkably tractable approximation, which is appropriate when there are ample inspection resources at the second stage. For this model, the last departure time is a Poisson random maximum, so that it is possible to give exact expressions and develop useful approximations based on extreme-value theory.
Keywords:Queues with terminating arrival processes  Last departure time  Infinite-server queues  Non-stationary queues  Congestion caused by inspection  Two-stage inspection  Extreme-value theory
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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