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

The “Largest Variance First” Policy in Some Stochastic Scheduling Problems

Author

Listed:
  • Michael Pinedo

    (Columbia University, New York, New York)

  • Gideon Weiss

    (Georgia Institute of Technology, Atlanta, Georgia)

Abstract

We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.

Suggested Citation

  • Michael Pinedo & Gideon Weiss, 1987. "The “Largest Variance First” Policy in Some Stochastic Scheduling Problems," Operations Research, INFORMS, vol. 35(6), pages 884-891, December.
  • Handle: RePEc:inm:oropre:v:35:y:1987:i:6:p:884-891
    DOI: 10.1287/opre.35.6.884
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.35.6.884?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. Janis Brammer & Bernhard Lutz & Dirk Neumann, 2022. "Stochastic mixed model sequencing with multiple stations using reinforcement learning and probability quantiles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 29-56, March.

    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:35:y:1987:i:6:p:884-891. 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.