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

On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop

Author

Listed:
  • S. Suresh

    (Virginia Polytechnic Institute and State University, Blacksburg, Virginia)

  • R. D. Foley

    (Virginia Polytechnic Institute and State University, Blacksburg, Virginia)

  • S. Elizabeth Dickey

    (Virginia Polytechnic Institute and State University, Blacksburg, Virginia)

Abstract

Pinedo has conjectured that, in a stochastic flow shop with m machines, n − 2 deterministic jobs with unit processing time, and two stochastic jobs each with mean one, the sequence minimizing the expected makespan would schedule one of the stochastic jobs first and the other last. We prove that Pinedo's conjecture is almost true: either Pinedo's sequence or a sequence with the stochastic jobs adjacent at one end of the sequence minimizes the expected makespan. Our result does not require the stochastic jobs to have an expected value of 1, nor even to be independent and identically distributed. We show that our result cannot be improved in the sense that, in some cases, one sequence is strictly optimal, and in some other cases, the other sequence is strictly optimal.

Suggested Citation

  • S. Suresh & R. D. Foley & S. Elizabeth Dickey, 1985. "On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop," Operations Research, INFORMS, vol. 33(5), pages 1146-1153, October.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:5:p:1146-1153
    DOI: 10.1287/opre.33.5.1146
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.5.1146
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.5.1146?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:5:p:1146-1153. 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.