On stochastic scheduling with precedence relations and switching costs

Abstract

A collection of jobs is to be processed by a single machine. The amount of processing required by each job is a random variable with a known probability distribution. The jobs must be processed in a manner which is consistent with a precedence relation but the machine is free to switch from one job to another at any time; such switches are costly, however. This paper discusses conditions under which there is an optimal strategy for allocating the machine to the jobs which is given by a fixed permutation of the jobs indicating in which order they should be processed. When this is so, existing algorithms may be helpful in giving the best job ordering.