Answers are grounded in this paper and cite their sources.
Suppose n jobs are to be processed on a single machine, subject to release dates and precedence constraints. The problem is to find a preemptive schedule which minimizes the maximum job completion cost. We present an O(n 2 ) algorithm for this problem, generalizing previous results of E. L. Lawler.
No takes yet. Share an insight, caveat, or question.
Baker et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: