One machine scheduling to minimize expected mean tardiness-Part 1

This paper considers the problem of scheduling a number of simultaneously available jobs with exponentially distributed processing times (with known means), on a single machine, to minimize the mean or total expected tardiness. The total expected tardiness is derived on the assumption that no two jobs have identical mean processing times. A condition that guarantees certain precedences is proved. The is used to develop a branch and bound algorithm.