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

A Heuristic for a Scheduling Problem with Communication Delays

Author

Listed:
  • Alix Munier

    (Université P. et M. Curie, Paris, France)

  • Jean-Claude König

    (Université d'Evry, Evry, France)

Abstract

This paper addresses a scheduling problem with interprocessor communication delays: the jobs and the communication delays are of unit length. The number of processors is unbounded. The aim is to minimize the makespan.We develop a new list scheduling heuristic and we prove that its worst-case relative performance is 4/3.

Suggested Citation

  • Alix Munier & Jean-Claude König, 1997. "A Heuristic for a Scheduling Problem with Communication Delays," Operations Research, INFORMS, vol. 45(1), pages 145-147, February.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:1:p:145-147
    DOI: 10.1287/opre.45.1.145
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.1.145
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.1.145?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. Xianzhao Zhang & Dachuan Xu & Donglei Du & Chenchen Wu, 2018. "Approximation algorithms for precedence-constrained identical machine scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 318-330, January.

    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:45:y:1997:i:1:p:145-147. 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.