Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
McMahon et al. (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: