An approximate solution and error bound for a discrete time queue with simultaneous servicing

DOI10.1016/S0377-2217(96)00107-5zbMath0917.90135OpenAlexW2131056063MaRDI QIDQ1278490

Nico M. van Dijk

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00107-5

zbMATH Keywords

explicit error bounddiscrete time queueapproximate recursive solution

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Product form in networks of queues with batch arrivals and batch services
• Closed queueing networks with batch services
• A general treatment of discrete-time buffers with one randomly interrupted output line
• Practical approximations for finite-buffer queueing models with batch arrivals
• Networks of queues in discrete time
• A discrete-time queueing network
• Product forms for queueing networks with state-dependent multiple job transitions
• Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks

This page was built for publication: An approximate solution and error bound for a discrete time queue with simultaneous servicing