Single-machine stochastic scheduling with dual criteria

Abstract

In this note we consider a single-machine scheduling problem where job processing times and due dates are random variables with known distributions. The objective of the problem is to find a sequence of the jobs such that a secondary criterion is minimized subject to a primary criterion being held at its best value. Three different models dealing with various primary and secondary criteria are analyzed in the paper. We provide algorithms to solve the problems optimally.