IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p455-47210.1023-a1018931508072.html
   My bibliography  Save this article

On the minimum number of processors for scheduling problems with communicationdelays

Author

Listed:
  • A. Moukrim

Abstract

Scheduling problems with interprocessor communication delays are recent problemsarising with the development of new message‐passing architectures whose number of processorsis increasing more and more. The scheduling problem with communication delays isNP‐complete even on an unlimited number of processors, and most of the restrictions whichare known to make the problem easy suppose that the number of processors is unlimited.The aim of this paper is to estimate the minimum number of processors required to realizea schedule that minimizes the makespan for problems with communication delays. Contraryto problems without communication costs, we show that the minimum number of partitioningpaths of tasks is not an upper bound. Then we propose two upper bounds b and b whichare valid independent of task processing times and communication costs. We show thatb can be calculated in O(n 2 ) if n designates the number of tasks. Then we give an algorithmfor determining b in the special case when the precedence graph is an in‐tree or anout-tree. A specific study of SCT task systems (Small Communication Time) shows that theachromatic number of the cocomparability graph is an upper bound on the minimum numberof processors. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • A. Moukrim, 1999. "On the minimum number of processors for scheduling problems with communicationdelays," Annals of Operations Research, Springer, vol. 86(0), pages 455-472, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:455-472:10.1023/a:1018931508072
    DOI: 10.1023/A:1018931508072
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018931508072
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018931508072?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Finke, Gerd & Lemaire, Pierre & Proth, Jean-Marie & Queyranne, Maurice, 2009. "Minimizing the number of machines for minimum length schedules," European Journal of Operational Research, Elsevier, vol. 199(3), pages 702-705, December.
    2. Kravchenko, Svetlana A. & Werner, Frank, 2009. "Minimizing the number of machines for scheduling jobs with equal processing times," European Journal of Operational Research, Elsevier, vol. 199(2), pages 595-600, December.

    More about this item

    Statistics

    Access and download statistics

    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:spr:annopr:v:86:y:1999:i:0:p:455-472:10.1023/a:1018931508072. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.