Random-order-of-service for heterogeneous customers: waiting time analysis

W. Rogiest (), K. Laevens (), J. Walraevens () and H. Bruneel ()

Annals of Operations Research, 2015, vol. 226, issue 1, 527-550

Abstract: In operations research and networking problems, random-order-of-service (ROS) provides a well-known alternative to the classic first-come-first-served (FCFS) policy. Models with ROS policy are typically harder to analyze than their FCFS counterparts, with some performance measures notoriously hard to obtain. While significant progress has been realized in the analysis of random-order-of-service models with homogeneous customer service demands, the impact of heterogeneous customer demand is largely unknown. The current contribution studies this impact, with a discrete-time random-order-of-service queue serving customers with heterogeneous demands. Customer service times are independent random variables with type-dependent distribution. The numbers of new arrivals in each slot are independent and identically distributed over time, but can be type-correlated within a single slot. This corresponds to bursty input traffic generated by a finite number of sources, with one source for each type. The burstiness consists in correlation among sources (or types): the rate at which a source generates customers depends on the instantaneous rate of all other sources (and vice versa). Using a transform-based approach yields closed-form formulas for the first few moments of the customer waiting time. Facilitator is a multi-stage description of the customer sojourn, which allows establishing a relation between the so-called conditional waiting time and the actual steady-state customer waiting time. A somewhat unexpected result shows that, under certain conditions on the arrival and service processes, the random-order-of-service policy outperforms the first-come-first-served policy in terms of mean waiting time. A number of numerical examples illustrate this finding. Copyright Springer Science+Business Media New York 2015

Keywords: Random-order-of-service; Service-in-random-order; Single server queue; Discrete time; First-come-first-served (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-014-1721-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:226:y:2015:i:1:p:527-550:10.1007/s10479-014-1721-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-014-1721-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().