On a bulk queueing system with impatient customers

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We consider a bulk arrival, bulk service queueing system. Customers are served in batches of r units if the queue length is not less than r. Otherwise, the server delays the service until the number of units in the queue reaches or exceeds level r. We assume that unserved customers may get impatient and leave the system. An ergodicity condition and steady-state probabilities are derived. Various system characteristics are also computed. © 1998 OPA (Overseas Publishers Association).

Cite

CITATION STYLE

APA

Tadj, L., Benkherouf, L., & Aggoun, L. (1998). On a bulk queueing system with impatient customers. Mathematical Problems in Engineering, 3(6), 539–554. https://doi.org/10.1155/S1024123X97000677

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free