Traditionally, the study of scheduling policies has focused on performance metrics such as
response time, queue length, and throughput. However, the more vague notion of 'fairness' …

Within the combinatorial scheduling community, there has been an increasing interest in
modelling and solving scheduling problems in dynamic environments. Such problems have …

The Shortest Remaining Processing Time (SRPT) scheduling policy and variants thereof
have been deployed in many computer systems, including web servers [5], networks [9] …

We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule
Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in …

We consider the problem of scheduling to minimize mean response time in M/G/1 queues
where only estimated job sizes (processing times) are known to the scheduler, where a job …

Computer systems researchers have begun to apply the Foreground–Background (FB)
scheduling discipline to a variety of applications, and as a result, there has been a …

Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …

Blind scheduling policies schedule tasks without knowledge of the tasks' remaining
processing times. Existing blind policies, such as FCFS, PS, and LAS, have proven useful in …

We consider scheduling to minimize mean response time of the M/G/k queue with unknown
job sizes. In the singleserver k= 1 case, the optimal policy is the Gittins policy, but it is not …

This paper gives an overview of recent research on the impact of scheduling on the tail
behavior of the response time of a job. We cover preemptive and non-preemptive …