Answers are grounded in this paper and cite their sources.
An optimal procedure is developed for the sequencing of n-jobs on one machine to minimize the maximum job lateness when the n-jobs have unequal early start times and due dates. The decision rule derived for the procedure primarily sequences the jobs in order of their nondecreasing early starts plus due dates. A branch-and-bound approach is employed by the procedure which moves to opti-mality in a finite number of steps.
No takes yet. Share an insight, caveat, or question.
Dessouky et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: