Optimal online algorithms for scheduling on two identical machines under a grade of service

被引：4
|
作者：
蒋义伟 [1 ]
何勇 [2 ]
唐春梅 [2 ]
机构：
[1] Laboratory of Information and Optimization Technologies, Ningbo Institute of Technology, Zhejiang University, Ningbo 315100, China Department of Mathematics, Zhejiang University, Hangzhou 310027, China
[2] Department of Mathematics, Zhejiang University, Hangzhou 310027, China
来源：
Journal of Zhejiang University Science A(Science in Engineering) | 2006年 / 03期
基金：
中国国家自然科学基金;
关键词：
Online algorithm; Competitive analysis; Parallel machine scheduling; Grade of service (GoS);
D O I：
暂无
中图分类号：
TP393.01 [];
学科分类号：
081201 ; 1201 ;
摘要：
This work is aimed at investigating the online scheduling problem on two parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels, so each job and machine are labelled with the GoS levels, and each job can be processed by a particular machine only when its GoS level is no less than that of the machine. The goal is to minimize the makespan. For non-preemptive version, we propose an optimal online al-gorithm with competitive ratio 5/3. For preemptive version, we propose an optimal online algorithm with competitive ratio 3/2.
引用
收藏
页码：309 / 314
页数：6
相关论文
共 50 条
  • [21] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong He
    Yi Wei Jiang
    Hao Zhou
    Acta Mathematica Sinica, English Series, 2007, 23 : 165 - 174
  • [22] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong HE Department of Mathematics
    ActaMathematicaSinica(EnglishSeries), 2007, 23 (01) : 165 - 174
  • [23] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    Yong He
    Yiwei Jiang
    Acta Informatica, 2004, 40 : 367 - 383
  • [24] Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels
    Cai Shuang
    Liu Ke
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2019, 32 (04) : 1180 - 1193
  • [25] Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels
    CAI Shuang
    LIU Ke
    Journal of Systems Science & Complexity, 2019, 32 (04) : 1180 - 1193
  • [26] Heuristics for Online Scheduling on Identical Parallel Machines with Two GoS Levels
    Shuang Cai
    Ke Liu
    Journal of Systems Science and Complexity, 2019, 32 : 1180 - 1193
  • [27] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Taibo Luo
    Yinfeng Xu
    Optimization Letters, 2016, 10 : 207 - 213
  • [28] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Luo, Taibo
    Xu, Yinfeng
    OPTIMIZATION LETTERS, 2016, 10 (01) : 207 - 213
  • [29] Online Scheduling on Identical Machines using SRPT
    Fox, Kyle
    Moseley, Benjamin
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 120 - 128
  • [30] Online algorithms for scheduling two parallel machines with a single server
    Jiang, Yiwei
    Yu, Feng
    Zhou, Ping
    Hu, Jueliang
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2015, 22 (05) : 913 - 927
12345