ON NON-PREEMPTIVE STRATEGIES IN STOCHASTIC SCHEDULING

被引：11
|
作者：
GLAZEBROOK, KD
机构：
来源：
NAVAL RESEARCH LOGISTICS | 1981年 / 28卷 / 02期
关键词：
DECISION THEORY AND ANALYSIS - PROBABILITY;
D O I：
10.1002/nav.3800280211
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
It is shown that there is an optimal strategy for a class of stochastic scheduling problems which is nonpreemptive. The results which yield this conclusion are generalizations of previous ones due to K. D. Glazebrook and J. C. Gittins. These new results also lead to an evaluation of the performance of nonpreemptive strategies in a large class of problems of practical interest.
引用
收藏
页码：289 / 300
页数：12
相关论文
共 50 条
  • [41] Non-preemptive min-sum scheduling with resource augmentation
    Bansal, Nikhil
    Chan, Ho-Leung
    Khandekar, Rohit
    Pruhs, Kirk
    Schieber, Baruch
    Stein, Cliff
    48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 614 - +
  • [42] An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
    Andrei, Stefan
    Cheng, Albert M. K.
    Grigoras, Gheorghe
    Radulescu, Vlad
    INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2012, 3 (04) : 215 - 223
  • [43] Preemption Delay Analysis for Floating Non-Preemptive Region Scheduling
    Marinho, Jose Manuel
    Nelis, Vincent
    Petters, Stefan M.
    Puaut, Isabelle
    DESIGN, AUTOMATION & TEST IN EUROPE (DATE 2012), 2012, : 497 - 502
  • [44] MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE
    Master, Neal
    Chan, Carri W.
    Bambos, Nicholas
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2018, 32 (01) : 1 - 36
  • [45] Quantifying the Exact Sub-Optimality of Non-Preemptive Scheduling
    Davis, Robert I.
    Thekkilakattil, Abhilash
    Gettings, Oliver
    Dobrin, Radu
    Punnekkat, Sasikumar
    2015 IEEE 36TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2015), 2015, : 96 - 106
  • [46] Processor Bounding for an Efficient Non-preemptive Task Scheduling Algorithm
    Ştefan Andrei
    Albert M. K. Cheng
    Vlad Rădulescu
    Mathematics in Computer Science, 2019, 13 : 489 - 515
  • [47] Performance evaluation of non-preemptive policies for scheduling readers and writers
    Kang, Sung-Il
    Pyun, Kihyun
    Lee, Heung-Kyu
    Operating Systems Review (ACM), 1999, 33 (03): : 43 - 57
  • [48] Non-preemptive coordination mechanisms for identical machine scheduling games
    Kollias, Konstantinos
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, 2008, 5058 : 197 - 208
  • [49] Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines
    G. Dósa
    Y. He
    Computing, 2006, 76 : 149 - 164
  • [50] Idle block based methods for cloud workflow scheduling with preemptive and non-preemptive tasks
    Chen, Long
    Li, Xiaoping
    Ruiz, Ruben
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 89 : 659 - 669
12345