IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v2y1986i1-2p61-69.html
   My bibliography  Save this article

Inequalities for stochastic flow shops and job shops

Author

Listed:
  • Michael Pinedo
  • Sung‐Hwan Wie

Abstract

Consider an m‐machine flow shop with n jobs. The processing time of job j, j = 1,…, n, on each one of the m machines is equal to the random variable Xj and is distributed according to Fj. We show that, under certain conditions, more homogeneous distributions F1,…, Fn result in a smaller expected makespan. We also study the effect of the variability of distribution Fj on the expected waiting costs of the n jobs and on the job sequencing which minimizes this total expected waiting cost. We show that the smallest (largest) variance first rule minimizes the total expected waiting cost on a single machine when the waiting cost function is increasing convex (concave). We also show that the smallest variance first rule minimizes, under given conditions, the total expected waiting cost in an m machine flow shop when the waiting cost function is increasing convex. Similar results are also obtained for the two‐machine job shop. Similar results cannot be obtained when the processing times of job j on the various machines are i.i.d. and distributed according to Fj.

Suggested Citation

  • Michael Pinedo & Sung‐Hwan Wie, 1986. "Inequalities for stochastic flow shops and job shops," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 2(1‐2), pages 61-69.
    • Handle: RePEc:wly:apsmda:v:2:y:1986:i:1-2:p:61-69
    DOI: 10.1002/asm.3150020106
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150020106
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asm.3150020106?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
    ---><---

    Citations

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


    Cited by:

    1. William P. Millhiser & Emre A. Veral, 2019. "A decision support system for real-time scheduling of multiple patient classes in outpatient services," Health Care Management Science, Springer, vol. 22(1), pages 180-195, March.
    2. Alcaide, D. & Rodriguez-Gonzalez, A. & Sicilia, J., 2002. "An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns," European Journal of Operational Research, Elsevier, vol. 140(2), pages 384-398, July.
    3. Forst, Frank G., 1995. "Bicriterion stochastic scheduling on one or more machines," European Journal of Operational Research, Elsevier, vol. 80(2), pages 404-409, January.

    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:wly:apsmda:v:2:y:1986:i:1-2:p:61-69. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-0747 .

    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.