This paper addresses a machine scheduling problem that arises in the case of scheduling tasks over an idealized distributed multiprocessor. Precedence constraints with small communication delays have to be taken into account and task duplication is allowed. A critical path-like algorithm is presented, which is shown to construct an optimal schedule in polynomial time.
No takes yet. Share an insight, caveat, or question.
Colin et al. (1991) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: