Browsing Mathematics (Faculty of) by Author "Drekic, Steve"
Now showing items 1-8 of 8
-
A 2-class maintenance model with dynamic server behavior
Granville, Kevin; Drekic, Steve (Springer, 2019-04-29)We analyze a 2-class maintenance system within a single-server polling model framework. There are C+f machines in the system, where C is the cap on the number of machines that can be turned on simultaneously (and hence, ... -
Controlling the workload of M/G/1 queues via the q-policy
Drekic, Steve; Fajardo, Val Andrei (Elsevier, 2015-06-01)We 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, ... -
A model for deceased-donor transplant queue waiting times
Drekic, Steve; Stanford, David A.; Woolford, Douglas G.; McAlister, Vivian C. (Springer, 2015-01-01)In many jurisdictions, organ allocation is done on the basis of the health status of the patient, either explicitly or implicitly. This paper presents a self-promoting priority queueing model for patient waiting times which ... -
On a 2-class polling model with reneging and ki -limited service
Granville, Kevin; Drekic, Steve (Springer, 2018-06-18)This paper analyzes a 2-class, single-server polling model operating under a ki-limited service discipline with class-dependent switchover times. Arrivals to each class are assumed to follow a Poisson process with phase-type ... -
On a general mixed priority queue with server discretion
Fajardo, Val Andrei; Drekic, Steve (Taylor & Francis, 2016-10-01)We 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, ... -
On the Number of Trials Needed to Obtain k Consecutive Successes
Drekic, Steve; Spivey, Michael Z. (Elsevier, 2021-04-30)A sequence of independent Bernoulli trials, each of which is a success with probability p, is conducted. For k ∈ Z+, let Xk be the number of trials required to obtain k consecutive successes. Using techniques from elementary ... -
The Unobserved Waiting Customer Approximation
Granville, Kevin; Drekic, Steve (Springer, 2021-06-02)We introduce a new approximation procedure to improve the accuracy of matrix analytic methods when using truncated queueing models to analyse infinite buffer systems. This is accomplished through emulating the presence of ... -
Waiting Time Distributions in the Preemptive Accumulating Priority Queue
Fajardo, Val Andrei; Drekic, Steve (Springer, 2017-03-01)We consider a queueing system in which a single server attends to N priority classes of customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a rate which is distinct to the class to ...