Show simple item record

dc.contributor.authorFajardo, Val Andrei
dc.contributor.authorDrekic, Steve 15:36:15 (GMT) 15:36:15 (GMT)
dc.descriptionThis is an Accepted Manuscript of an article published by Taylor & Francis in Stochastic Models on June, 24, 2016, available online:
dc.description.abstractWe consider a single-server queueing system which attends to N priority classes that are classified into two distinct types: (i) urgent: classes which have preemptive resume priority over at least one lower priority class, and (ii) non-urgent: classes which only have non-preemptive priority among lower priority classes. While urgent customers have preemptive priority, the ultimate decision on whether to interrupt a current service is based on certain discretionary rules. An accumulating prioritization is also incorporated. The marginal waiting time distributions are obtained and numerical examples comparing the new model to other similar priority queueing systems are provided.en
dc.description.sponsorshipThis research was supported by the Natural Sciences and Engineering Research Council of Canada. In particular, Steve Drekic acknowledges the financial support provided via the agency's Discovery Grants program (#238675-2010-RGPIN).en
dc.publisherTaylor & Francisen
dc.subjectAccumulating priorityen
dc.subjectLaplace–Stieltjes transformen
dc.subjectMixed priority queueen
dc.subjectServer discretion rulesen
dc.subjectWaiting time distributionen
dc.titleOn a general mixed priority queue with server discretionen
dcterms.bibliographicCitationV.A. Fajardo and S. Drekic. On a general mixed priority queue with server discretion. Stochastic Models 32 (2016) 643-673.en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Statistics and Actuarial Scienceen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages