Complexity of non-preemptive single machine scheduling problems in the presence of uncertainty

This paper deals with single machine scheduling problems where some job characteristics are uncertain. This uncertainty is described through a finite set S of well-defined scenarios. We denote by pj , d s j and w s j , respectively, the processing time, the due date and the weight of job j under scenario s ∈ S. Consider a scheduling problem, denoted by… CONTINUE READING