ON SCHEDULING INFLUENTIAL STOCHASTIC TASKS ON A SINGLE-MACHINE

被引：6
|
作者：
GLAZEBROOK, KD
GREATRIX, S
机构：
[1] Department of Mathematics and Statistics, University of Newcastle upon Tyne
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 70卷 / 03期
关键词：
GITTING INDEX; OPTIMAL POLICY; MARKOV DECISION PROCESS; STOCHASTIC SCHEDULING;
D O I：
10.1016/0377-2217(93)90251-H
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
A single machine is available to process a collection of stochastic tasks in a manner consistent with precedence constraint GAMMA. The degree of success encountered in the processing of a task influences the returns from tasks processed later. Two different modes of influence (called sequence and predecessor) are considered, but influence is always expressed via a multiplicative contribution to the appropriate returns. Developments of Gittins index theory yield optimal policies in the class of preemptive/nonpreemptive/permutation policies for a variety of assumptions about GAMMA.
引用
收藏
页码：405 / 424
页数：20
相关论文
共 50 条
  • [41] Single machine scheduling with stochastically dependent times
    Wei Wei
    Journal of Scheduling, 2019, 22 : 677 - 689
  • [42] Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
    Jagtenberg, Caroline
    Schwiegelshohn, Uwe
    Uetz, Marc
    APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 142 - 153
  • [43] Single machine scheduling when processing times are correlated normal random variables
    Boys, RJ
    Glazebrook, KD
    McCrone, CM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 102 (01) : 111 - 123
  • [44] A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
    M. Urgo
    J. Váncza
    Flexible Services and Manufacturing Journal, 2019, 31 : 472 - 496
  • [45] A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
    Urgo, M.
    Vancza, J.
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2019, 31 (02) : 472 - 496
  • [46] Scheduling Stochastic jobs on a repairable machine with general phase type uptime
    Wei Li
    Attahiru Sule Alfa
    Mathematical Methods of Operations Research, 2005, 61 : 399 - 417
  • [47] Scheduling stochastic jobs on a repairable machine with general phase type uptime
    Li, W
    Alfa, AS
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2005, 61 (03) : 399 - 417
  • [48] Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling
    Jaeger, Sven
    Skutella, Martin
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [49] Greed Works-Online Algorithms for Unrelated Machine Stochastic Scheduling
    Gupta, Varun
    Moseley, Benjamin
    Uetz, Marc
    Xie, Qiaomin
    MATHEMATICS OF OPERATIONS RESEARCH, 2020, 45 (02) : 497 - 516
  • [50] Scheduling deteriorating jobs on a single machine subject to breakdowns
    Xiaoqiang Cai
    Xianyi Wu
    Xian Zhou
    Journal of Scheduling, 2011, 14 : 173 - 186
12345