ON A NO ARRIVALS HEURISTIC FOR SINGLE-MACHINE STOCHASTIC SCHEDULING
成果类型：
Article
署名作者：
FAY, NA; GLAZEBROOK, KD
署名单位：
Newcastle University - UK
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.1.168
发表日期：
1992
页码：
168-177
关键词：
摘要：
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.