Abstract We present a new (3/2+ 1/e)-approximation algorithm for the Ordered Traveling
Salesperson Problem (Ordered TSP). Ordered TSP is a variant of the classic metric …

We study the problem of scheduling precedence-constrained tasks to balance between
performance and energy consumption. We consider a system with multiple servers capable …

We consider the problem of scheduling jobs with precedence constraints on related
machines to minimize the weighted sum of completion times, in the presence of …

We consider the problem of scheduling precedence-constrained jobs on uniformly-related
machines in the presence of an arbitrary, fixed communication delay. Communication delay …

Multi-dimensional Scaling (MDS) is a family of methods for embedding pair-wise
dissimilarities between $ n $ objects into low-dimensional space. MDS is widely used as a …

We consider the problem of efficiently scheduling jobs with precedence constraints on a set
of identical machines in the presence of a uniform communication delay. Such precedence …

Consider a set of jobs connected to a directed acyclic task graph with a fixed source and
sink. The edges of this graph model precedence constraints and the jobs have to be …

We present a new $(\frac32+\frac1 {\mathrm {e}}) $-approximation algorithm for the Ordered
Traveling Salesperson Problem (Ordered TSP). Ordered TSP is a variant of the classical …

Scheduling precedence-constrained tasks is a classical problem that has been studied for
more than fifty years. However, little progress has been made in the setting where there are …

In the problem of scheduling with non-uniform communication delays, the input is a set of
jobs with precedence constraints. Associated with every precedence constraint between a …