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

Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines

Author

Listed:
  • Michael Pinedo

    (Columbia University, New York, New York)

  • Gideon Weiss

    (Georgia Institute of Technology, Atlanta, Georgia and Tel Aviv University, Tel Aviv, Israel)

Abstract

We consider n jobs with independent exponentially distributed processing times that are to be processed on two machines operating in parallel. The jobs are subject to precedence constraints that have the form of an intree, i.e., each job, except for the last one, has one direct successor. A job is at level l if its successor is at level l − 1 (the last job is at level 0). We assume that all jobs at level l have i.i.d. exponentially distributed processing times, with mean 1/μ l . Under these assumptions, we show that the policy that schedules HLF (highest level first) minimizes the expected makespan in the class of preemptive as well as nonpreemptive schedules. This conclusion generalizes a previous result of Chandy and Reynolds.

Suggested Citation

  • Michael Pinedo & Gideon Weiss, 1985. "Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines," Operations Research, INFORMS, vol. 33(6), pages 1381-1388, December.
  • Handle: RePEc:inm:oropre:v:33:y:1985:i:6:p:1381-1388
    DOI: 10.1287/opre.33.6.1381
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.6.1381
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.33.6.1381?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
    ---><---

    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:33:y:1985:i:6:p:1381-1388. 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.