IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i3-supplement-2ps263-s271.html
   My bibliography  Save this article

Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair

Author

Listed:
  • V. G. Kulkarni

    (University of North Carolina, Chapel Hill, North Carolina)

  • P. F. Chimento

    (IBM Corporation, Research Triangle Park, North Carolina)

Abstract

In this paper, we consider the problem of scheduling n tasks on two processors. The processing times of the n tasks are i.i.d. exponential random variables. The precedence constraints among the n tasks form an in-tree. The two processors are subject to failure and repair in a completely arbitrary manner, but are independent of the task processing times. We introduce the concept of stochastic partial ordering on random in-trees and show that among all policies, the highest level first (HLF) policy produces the smallest in-tree of unfinished tasks under the stochastic partial ordering. This implies that the HLF policy stochastically minimizes the makespan even when the two processors are subject to failures and repairs. As a special case, we also show that the HLF policy minimizes the dynamic failure probability when the processors are subject to failure, but no repairs can be done.

Suggested Citation

  • V. G. Kulkarni & P. F. Chimento, 1992. "Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair," Operations Research, INFORMS, vol. 40(3-supplem), pages 263-271, June.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:3-supplement-2:p:s263-s271
    DOI: 10.1287/opre.40.3.S263
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.3.S263
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.3.S263?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:40:y:1992:i:3-supplement-2:p:s263-s271. 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.