Answers are grounded in this paper and cite their sources.
We show that the problem of finding an optimal schedule for a set of jobs is polynomial complete even in the following two restricted cases.
No takes yet. Share an insight, caveat, or question.
Jeffrey D. Ullman (1973) studied this question.