IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i4p680-684.html
   My bibliography  Save this article

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

Author

Listed:
  • J. Y. Colin

    (Office National d'Etudes et de Recherches Aerospatiales, Châtillon, France)

  • P. Chrétienne

    (Université Pierre et Marie Curie, Paris, France)

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.

Suggested Citation

  • J. Y. Colin & P. Chrétienne, 1991. "C.P.M. Scheduling with Small Communication Delays and Task Duplication," Operations Research, INFORMS, vol. 39(4), pages 680-684, August.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:4:p:680-684
    DOI: 10.1287/opre.39.4.680
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.4.680
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.4.680?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guo, Peng & Weidinger, Felix & Boysen, Nils, 2019. "Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals," Omega, Elsevier, vol. 89(C), pages 110-121.
    2. Lisa Hollermann & Tsan-sheng Hsu & Dian Rae Lopez & Keith Vertanen, 1997. "Scheduling Problems in a Practical Allocation Model," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 129-149, June.
    3. Sanjoy K. Baruah, 1998. "The Multiprocessor Scheduling of Precedence-Constrained Task Systems in the Presence of Interprocessor Communication Delays," Operations Research, INFORMS, vol. 46(1), pages 65-72, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:39:y:1991:i:4:p:680-684. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.