C.P.M. Scheduling with Small Communication Delays and Task Duplication

J. Y. Colin and P. Chrétienne
Additional contact information
J. Y. Colin: Office National d'Etudes et de Recherches Aerospatiales, Châtillon, France
P. Chrétienne: Université Pierre et Marie Curie, Paris, France

Operations Research, 1991, vol. 39, issue 4, 680-684

Abstract: 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.

Keywords: computers: task allocation on distributed memory processors; production/scheduling: scheduling with interprocessor communication delays (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.4.680 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:4:p:680-684

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().