Answers are grounded in this paper and cite their sources.
This paper presents an optimal procedure for sequencing n jobs on one machine to minimize the maximum lateness when they may have different ready times, processing times, and due dates. This procedure is significantly more efficient for difficult problems than the McMahon/Florian algorithm which has achieved the best results in this area to date. The primary measures of computational efficiency for these procedures are the mean computer processing time and the percentage of problems solved optimally within a given time limit. An experiment that employs response surface methodology to locate problems within the region of highest difficulty shows the comparative efficiency of this procedure.
No takes yet. Share an insight, caveat, or question.
Larson et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: