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.
No takes yet. Share an insight, caveat, or question.
Fujii et al. (1969) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: