We introduce and study a general scheduling problem that we term the Polytope Scheduling
problem (PSP). In this problem, jobs can have different arrival times and sizes, and the rates …

We give a principled method to design online algorithms (for potentially non-linear
problems) using a mathematical programming formulation of the problem, and also to …

New optical technologies offer the ability to reconfigure network topologies dynamically,
rather than setting them once and for all. This is true in both optical wide area networks …

In this work, we study the problem of scheduling parallelizable jobs online with an objective
of minimizing average flow time. Each parallel job is modeled as a DAG where each node is …

We consider the classical problem of minimizing the total weighted flow-time for unrelated
machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over …

We consider preemptive online scheduling algorithms to minimize the total
weighted/unweighted flow time plus energy for speed-scalable heterogeneous …

This paper establishes performance guarantees for online algorithms that schedule
stochastic, nonpreemptive jobs on unrelated machines to minimize the expected total …

This paper considers scheduling parallelizable jobs in the non-clairvoyant speed scaling
setting to minimize the objective of weighted flow time plus energy. Previously, strong lower …

Round Robin is a widely used scheduling policy, used primarily because it is intuitively fair,
splitting the resources evenly among the jobs. Little is known, however, of its fairness with …

We present an unified approach to study online scheduling problems in the resource
augmentation/speed scaling models. Potential function method is extensively used for …