We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or slow servers each of speed?” Our setting is the system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time,...
In this paper a priority queuing system MX1,MX2/G1(a,b),G2(a,b)/1 with multiple vacations, setup tim...
This paper provides the first exact analysis of a preemptive M/M/c queue with two priority classes h...
International audienceWe present a simple approximate solution for preemptive-resume queues with mul...
We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fas...
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: on...
Abstract: "We ask the question, 'for minimizing mean response time, which is preferable: one fast se...
In this thesis, we first study delay systems with different classes of impatient customers. We analy...
We are interested in queues in which customers of different classes arrive to a service facility, an...
This paper provides the first exact analysis of a preemptive M=M=c queue with two priority classes h...
A novel flexible discipline for providing priority in a single-server queue is applied to the system...
AbstractWe consider a M/M/1 queue with two types of customers.The server suffers some loss when a no...
A priority queueing model with many types of requests and restricted processor sharing is considered...
We give sufficient conditions under which a policy that assigns customers to the Fastest Available S...
The cµ rule is known to be optimal in many queueing systems with memoryless service times. We establ...
Relative priorities in an n-class queueing system can reduce server and customer costs. This propert...
In this paper a priority queuing system MX1,MX2/G1(a,b),G2(a,b)/1 with multiple vacations, setup tim...
This paper provides the first exact analysis of a preemptive M/M/c queue with two priority classes h...
International audienceWe present a simple approximate solution for preemptive-resume queues with mul...
We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fas...
We ask the question, "for minimizing mean response time (sojourn time), which is preferable: on...
Abstract: "We ask the question, 'for minimizing mean response time, which is preferable: one fast se...
In this thesis, we first study delay systems with different classes of impatient customers. We analy...
We are interested in queues in which customers of different classes arrive to a service facility, an...
This paper provides the first exact analysis of a preemptive M=M=c queue with two priority classes h...
A novel flexible discipline for providing priority in a single-server queue is applied to the system...
AbstractWe consider a M/M/1 queue with two types of customers.The server suffers some loss when a no...
A priority queueing model with many types of requests and restricted processor sharing is considered...
We give sufficient conditions under which a policy that assigns customers to the Fastest Available S...
The cµ rule is known to be optimal in many queueing systems with memoryless service times. We establ...
Relative priorities in an n-class queueing system can reduce server and customer costs. This propert...
In this paper a priority queuing system MX1,MX2/G1(a,b),G2(a,b)/1 with multiple vacations, setup tim...
This paper provides the first exact analysis of a preemptive M/M/c queue with two priority classes h...
International audienceWe present a simple approximate solution for preemptive-resume queues with mul...