Some simple scheduling algorithms

This paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty-free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single-machine case, and maximum lateness for a restricted multi-machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine case.