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

Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems

Author

Listed:
  • Susan H. Xu

    (The Pennsylvania State University, University Park, Pennsylvania)

Abstract

This paper considers a stochastic system where a fixed number of nonpreemptive jobs (no new jobs arrive) are to be processed on multiple nonidentical processors. Each processor has an increasing hazard rate processing time distribution and the processors are ordered in ascending order of their expected processing times. It is shown that the policy which minimizes the total expected delay of all the jobs (flowtime) has a threshold structure. This policy would utilize the fastest available processor only if its mean processing time is less than a critical number. Furthermore, a previously rejected processor must never be utilized at later times. This policy is also individually optimal in the sense that it minimizes the delay of each job subject to the constraint that processor preference is given to jobs at the head of the buffer. This result proves the conjecture of P. R. Kumar and J. Walrand regarding socially and individually optimal policies in parallel routing systems.

Suggested Citation

  • Susan H. Xu, 1992. "Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems," Operations Research, INFORMS, vol. 40(2), pages 367-375, April.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:2:p:367-375
    DOI: 10.1287/opre.40.2.367
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.2.367
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.2.367?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:2:p:367-375. 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.