As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system parameters, e.g., service rates, are fixed exogenously, and then proceeds to design and analyze scheduling policies that provide efficient performance, e.g., small response time (sojourn time). However, in reality, the arrival rate and/or service rate may depend on the scheduling and, more generally, the performance of the system. For example, if arrivals are strategic then a decrease in the mean response time due to improved scheduling may result in an increase in the arrival rate
This Thesis is brought to you for free and open access by the Graduate School at VCU Scholars Compas...
Any buyer that depends on suppliers for the delivery of a service or the production of a make-to-ord...
We study the problem of routing jobs in multi-class multi-server queueing systems, where the service...
As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system param...
(Introductory Level for EORMS) This article introduces queueing disciplines, also known as schedulin...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
The study of size-based and size-oblivious scheduling policies with inaccurate job size information ...
We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the pr...
In this thesis, we study different scheduling policies in service networks. In Chapter 2, we conside...
International audienceIn service systems, the service level is often represented by a percentile of ...
We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline ...
Minimizing the slowdown (expected sojourn time divided by job size) is a key concern of fairness in ...
Businesses rely increasingly on Internet services as the basis of their income. Downtime and poor pe...
This Thesis is brought to you for free and open access by the Graduate School at VCU Scholars Compas...
Any buyer that depends on suppliers for the delivery of a service or the production of a make-to-ord...
We study the problem of routing jobs in multi-class multi-server queueing systems, where the service...
As a field, queueing theory predominantly assumes that the arrival rate of jobs and the system param...
(Introductory Level for EORMS) This article introduces queueing disciplines, also known as schedulin...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
Traditionally, research focusing on the design of routing and staffing policies for service systems ...
The study of size-based and size-oblivious scheduling policies with inaccurate job size information ...
We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the pr...
In this thesis, we study different scheduling policies in service networks. In Chapter 2, we conside...
International audienceIn service systems, the service level is often represented by a percentile of ...
We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline ...
Minimizing the slowdown (expected sojourn time divided by job size) is a key concern of fairness in ...
Businesses rely increasingly on Internet services as the basis of their income. Downtime and poor pe...
This Thesis is brought to you for free and open access by the Graduate School at VCU Scholars Compas...
Any buyer that depends on suppliers for the delivery of a service or the production of a make-to-ord...
We study the problem of routing jobs in multi-class multi-server queueing systems, where the service...