The last departure time from an M_t/G/ queue with a terminating arrival process

DOI10.1007/S11134-008-9060-2MaRDI QIDQ2425549zbMATH OpenOpenAlexFDO

Authors David A. Goldberg, Ward Whitt

Publication date 6 May 2008

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s11134-008-9060-2

zbMATH Keywords

congestion caused by inspectionextreme-value theoryinfinite-server queueslast departure timenon-stationary queuesqueues with terminating arrival processestwo-stage inspection

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

In this paper, the last departure time from a \(M_t/G/\infty\) queue with a terminating arrival process is considered as an appropriate approximation for a real application concerning a two-stage inspection in which finitely many items come to a first stage for screening and next go to a second stage to be examined further (e.g. inspecting shipping containers). The paper introduces the problem of evaluating the probability distribution for the last departure time from a queue with a terminating arrival process. Technically, the explicit expression for the remaining time are given, together with approximations for the transient distributions. Next, the approximations are compared with the exact values of the mean, variance and several quantiles of the distribution of the last departure time, for validation. The numerical results show that the approximations are remarkably effective for the exponential-tail case, provided that certain conditions are satisfied.

Recommendations

• The Physics of the Mt/G/∞ Queue
• Maximum remaining service time in infinite-server queues
• Departures in \(GR^{X_ n}/ G_ n/ \infty\)
• Departures from a Queue with Many Busy Servers
• Stationary Poisson departure processes from non-stationary queues

Cites work

• Asymptotics for M/G/1 low-priority waiting-time tail probabilities
• scientific article; zbMATH DE number 3117699 (Why is no real title available?)
• scientific article; zbMATH DE number 3174015 (Why is no real title available?)
• scientific article; zbMATH DE number 1958330 (Why is no real title available?)
• scientific article; zbMATH DE number 3338262 (Why is no real title available?)
• Numerical Solution of Piecewise-Stationary M_t/G_t/1 Queues
• Stochastic-Process Limits
• The Physics of the Mt/G/∞ Queue
• Two-Moment Approximations for Maxima

Cited in

(1)

• Two-parameter heavy-traffic limits for infinite-server queues

This page was built for publication: The last departure time from an \(M_t/G/\infty\) queue with a terminating arrival process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425549)