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