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

N. A. Fay and K. D. Glazebrook
Additional contact information
N. A. Fay: University of Durham, Durham, United Kingdom
K. D. Glazebrook: University of Newcastle Upon Tyne, Newcastle Upon Tyne, United Kingdom

Operations Research, 1992, vol. 40, issue 1, 168-177

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.

Keywords: production/scheduling; stochastic: models with arrivals; queues: optimal resource allocation (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.168 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:1:p:168-177

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().