The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

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 …

During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …

In this paper, an overview of the research devoted to these problems with emphasis on the
case of the optimal makespan on identical parallel machines is presented. Scheduling …

We consider a version ofmultiprocessor scheduling with the special feature that jobs may be
rejected at a certain penalty. An instance of the problem is given by m identical parallel …

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 …

The problem of scheduling jobs on parallel machines is studied when (1) the existence of a
job is not known until its unknown release date and (2) the processing requirement of a job …

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 …

Virtually all research in scheduling theory has been concerned with clairvoyant scheduling
where it is assumed that the characteristics of a job (in particular, its execution time, release …

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 …