Résumé: To solve difficult problem with m ⩾ 3 processors, a computational approach is formulated based on a discretized model in which the failure law is the analogous geometric distribution. By proving a unimodality property of the optimal completion probability, a computation of this optimum can be described that requires O(mn log n) time, where n is the job running time.

Langue: Anglais