Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers

DOI10.1007/BF01150854zbMath0664.60094MaRDI QIDQ1115031

Kim L. Ong, Michael R. Taaffe

Publication date: 1989

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

approximation methodnonstationary Interrupted Poisson arrival processtime-dependent queue length

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Time-dependent queueing network approximations as simulation external control variates, Time-Varying Robust Queueing, Virtual Statistics in Simulation via k Nearest Neighbors, Networks of infinite-server queues with nonstationary Poisson input, Using different response-time requirements to smooth time-varying demand for service, Decomposition approximations for time-dependent Markovian queueing networks

Uses Software

• IMSL Numerical Libraries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating nonstationary Ph(t)/Ph(t)/1/c queueing systems
• The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• Approximating nonstationary two-priority non-preemptive queueing systems
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• A Closure Approximation for the Nonstationary M/M/s Queue
• Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room
• An Overflow System in Which Queuing Takes Precedence
• Poisson Arrivals See Time Averages
• A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
• The Interrupted Poisson Process As An Overflow Process