Single-processor scheduling with time restrictions

Abstract

We consider the following list scheduling problem. We are given a set $S$ of jobs which are to be scheduled sequentially on a single processor. Each job has an associated processing time which is required for its processing. Given a particular permutation of the jobs in $S$, the jobs are processed in that order with each job started as soon as possible, subject only to the following constraint: For a fixed integer $B \ge 2$, no unit time interval $[x, x+1)$ is allowed to intersect more than $B$ jobs for any real $x$. It is not surprising that this problem is NP-hard when the value $B$ is variable (which is typical of many scheduling problems). There are several real world situations for which this restriction is natural. For example, suppose in addition to our jobs being executed sequentially on a single main processor, each job also requires the use of one of $B$ identical subprocessors during its execution. Each time a job is completed, the subprocessor it was using requires one unit of time in order to reset itself. In this way, it is never possible for more than $B$ jobs to be worked on during any unit interval. In this paper we carry out a classical worst-case analysis for this situation. In particular, we show that any permutation of the jobs can be processed within a factor of $2-1/(B-1)$ of the optimum (plus an additional small constant) when $B \ge 3$ and this factor is best possible. For the case $B=2$, the situation is rather different, and in this case the corresponding factor we establish is $4/3$ (plus an additional small constant), which is also best possible. It is fairly rare that best possible bounds can be obtained for the competitive ratios of list scheduling problems of this general type.