Measures of problem uncertainty for scheduling with interval processing times

What is it about?

This paper deals with a single machine scheduling problem with uncertain processing times. An approach is suggested which consists of calculating measures of uncertainty to choose an appropriate solution method. The measures are based on the concept of a minimal dominant set containing at least one optimal schedule for any possible realization of the processing times. Computational results are presented for instances with up to 5000 jobs.

Featured Image