— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...