The scheduling of computer and manufacturing systems has been the subject of extensive
research for over forty years. In addition to computers and manufacturing, scheduling theory …

We have seen a variety of on-line scheduling problems. Many of them are understood
satisfactorily, but there are also many interesting open problems. Studied scheduling …

The essence of the routing problem in real networks is that the traffic demand from a source
to destination must be satisfied by choosing a single path between source and destination …

In this chapter, we summarize research e orts on several di erent problems that fall under the
rubric of online scheduling. In online scheduling, the scheduler receives jobs that arrive over …

In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-
to-point and multicast) where the goal is to route all requests while minimizing the required …

We study a classical problem in online scheduling. A sequence of jobs must be scheduled
on m identical parallel machines. As each job arrives, its processing time is known. The goal …

General: The machine load balancing problem is defined as follows: There are n parallel
machines and a number of independent tasks (jobs); the tasks arrive at arbitrary times …

We revisit a classical load balancing problem in the modern context of decentralized
systems and self-interested clients. In particular, there is a set of clients, each of whom must …

We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the
right-hand vertices. We refer to this problem as the optimal semi-matching problem; it is a …

We study the load balancing problem in the context of a set of clients each wishing to run a
job on a server selected among a subset of permissible servers for the particular client. We …