Key points are not available for this paper at this time.
An algorithm is developed for sequencing jobs on a single processor in order to minimize maximum lateness, subject to ready times and due dates. The method that we develop could be classified as branch-and-bound. However, it has the unusual feature that a complete solution is associated with each node of the enumeration tree.
McMahon et al. (1975) studied this question.