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

On a “No Arrivals” Heuristic for Single Machine Stochastic Scheduling

Author

Listed:
  • N. A. Fay

    (University of Durham, Durham, United Kingdom)

  • K. D. Glazebrook

    (University of Newcastle Upon Tyne, Newcastle Upon Tyne, United Kingdom)

Abstract

In many contexts in which resource allocation takes place in a stochastic environment, new jobs arrive over time. Incorporation of an arrivals process into the scheduling model significantly complicates the problem of determining optimal strategies. Earlier computational studies suggest that for a large class of single machine problems often little is lost by adopting a heuristic that (essentially) ignores the arrivals process. Cases are described in which the heuristic yields an optimal strategy and analytical tools are developed that enable its evaluation. The heuristic performs well, both when arrivals are rare and when arrivals of good jobs are frequent.

Suggested Citation

  • N. A. Fay & K. D. Glazebrook, 1992. "On a “No Arrivals” Heuristic for Single Machine Stochastic Scheduling," Operations Research, INFORMS, vol. 40(1), pages 168-177, February.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:1:p:168-177
    DOI: 10.1287/opre.40.1.168
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.1.168
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.1.168?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:1:p:168-177. 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.