Bulk queue

Quality 0.50 · 0 views · Updated 2 months ago

title: "Bulk queue" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["single-queueing-nodes"] topic_path: "general/single-queueing-nodes" source: "https://en.wikipedia.org/wiki/Bulk_queue" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

In queueing theory, a discipline within the mathematical theory of probability, a bulk queue (sometimes batch queue) is a general queueing model where jobs arrive in and/or are served in groups of random size. Batch arrivals have been used to describe large deliveries and batch services to model a hospital out-patient department holding a clinic once a week, a transport link with fixed capacity and an elevator.

Networks of such queues are known to have a product form stationary distribution under certain conditions. Under heavy traffic conditions a bulk queue is known to behave like a reflected Brownian motion.

Kendall's notation

In Kendall's notation for single queueing nodes, the random variable denoting bulk arrivals or service is denoted with a superscript, for example MX/MY/1 denotes an M/M/1 queue where the arrivals are in batches determined by the random variable X and the services in bulk determined by the random variable Y. In a similar way, the GI/G/1 queue is extended to GIX/GY/1.

Bulk service

Customers arrive at random instants according to a Poisson process and form a single queue, from the front of which batches of customers (typically with a fixed maximum size) are served at a rate with independent distribution. The equilibrium distribution, mean and variance of queue length are known for this model.

The optimal maximum size of batch, subject to operating cost constraints, can be modelled as a Markov decision process.

Bulk arrival

Optimal service-provision procedures to minimize long run expected cost have been published.

Waiting Time Distribution

The waiting time distribution of bulk Poisson arrival is presented in.

References

References

  1. (1981). "A Diffusion Approximation for Bulk Queues". [[Management Science (journal).
  2. Özden, Eda. (2012). "Discrete Time Analysis of Consolidated Transport Processes". KIT Scientific Publishing.
  3. (1983). "A first course in bulk queues". Wiley.
  4. (1998). "Optimal Batch Provisioning to Customers Subject to a Delay-Limit". [[Management Science (journal).
  5. Deb, Rajat K.. (1978). "Optimal Dispatching of a Finite Capacity Shuttle". [[Management Science (journal).
  6. (1987). "Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times". Transportation Science.
  7. Marcel F. Neuts. (1967). "A General Class of Bulk Queues with Poisson Input". The Annals of Mathematical Statistics.
  8. (1990). "Product form in networks of queues with batch arrivals and batch services". [[Queueing Systems]].
  9. (1970). "Multiple Channel Queues in Heavy Traffic. II: Sequences, Networks, and Batches". Advances in Applied Probability.
  10. (2013). "Product-forms in batch networks: Approximation and asymptotics". [[Performance Evaluation]].
  11. (1955). "Waiting Time in Bulk Service Queues". [[Royal Statistical Society]].
  12. Bailey, Norman T. J.. (1954). "On Queueing Processes with Bulk Service". [[Journal of the Royal Statistical Society, Series B]].
  13. (1973). "Optimal Control of Batch Service Queues". Advances in Applied Probability.
  14. "Waiting Time Distribution in a Poisson Queue with a General Bulk Service Rule". Management Science.

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::

single-queueing-nodes