Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals
From MaRDI portal
Publication:3764997
DOI10.1287/TRSC.20.2.65zbMath0628.60099OpenAlexW2039185677MaRDI QIDQ3764997
Publication date: 1986
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.20.2.65
bulk arrivalNumerical experimentscompound Poisson arrivalsbulk service queuesdispatching strategiesIterative numerical procedures
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Computational analysis of single-server bulk-arrival queues \(M^ X/G/1\) ⋮ Computational analysis of single-server bulk-arrival queues: GI X/M/1 ⋮ Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues ⋮ The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals ⋮ Optimal dispatching of an infinite capacity shuttle with compound Poisson arrivals: Control at a single terminal
This page was built for publication: Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals