Los puntos clave no están disponibles para este artículo en este momento.
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.
Jeffrey D. Ullman (Mon,) studied this question.