Show simple item record

dc.contributor.authorDrekic, Steve
dc.contributor.authorFajardo, Val Andrei
dc.date.accessioned2017-06-14 15:03:00 (GMT)
dc.date.available2017-06-14 15:03:00 (GMT)
dc.date.issued2015-06-01
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2014.12.036
dc.identifier.urihttp://hdl.handle.net/10012/12006
dc.descriptionThe final publication is available at Elsevier via https://doi.org/10.1016/j.ejor.2014.12.036 © 2015. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.description.abstractWe consider a single-server queueing system with Poisson arrivals and generally distributed service times. To systematically control the workload of the queue, we define for each busy period an associated timer process, {R(t), t ≥ 0}, where R(t) represents the time remaining before the system is closed to potential arrivals. The process {R(t), t ≥ 0} is similar to the well-known workload process, in that it decreases at unit rate and consists of up-jumps at the arrival instants of admitted customers. However, if X represents the service requirement of an admitted customer, then the magnitude of the up-jump for the timer process occurring at the arrival instant of this customer is (1 − q)X for a fixed q ∈ [0, 1]. Consequently, there will be an instant in time within the busy period when the timer process hits level zero, at which point the system immediately closes and will remain closed until the end of the current busy period. We refer to this particular blocking policy as the q-policy. In this paper, we employ a level crossing analysis to derive the Laplace–Stieltjes transform (LST) of the steady-state waiting time distribution of serviceable customers. We conclude the paper with a numerical example which shows that controlling arrivals in this fashion can be beneficial.en
dc.description.sponsorshipNSERC (Natural Sciences and Engineering Research Council of Canada)en
dc.language.isoenen
dc.publisherElsevieren
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectQueueingen
dc.subjectCustomer blockingen
dc.subjectLevel crossing analysisen
dc.subjectM/G/1 queue with accumulating priorityen
dc.titleControlling the workload of M/G/1 queues via the q-policyen
dc.typeArticleen
dcterms.bibliographicCitationV.A. Fajardo and S. Drekic. Controlling the workload of M/G/1 queues via the q-policy. European Journal of Operational Research 243 (2015) 607-617.en
uws.contributor.affiliation1Faculty of Mathematicsen
uws.contributor.affiliation2Statistics and Actuarial Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusRevieweden
uws.scholarLevelFacultyen


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 International
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International

UWSpace

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