Los puntos clave no están disponibles para este artículo en este momento.
This paper presents an efficient algorithm for a class of sequencing problems in which n tasks with an arbitrary precedence relation have to be processed by two processors of equal ability, and each task requires one unit of time.
Fujii et al. (Tue,) studied this question.