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
基金
中国国家自然科学基金;
关键词
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 条
  • [41] Online Order Scheduling Problem with the Same Order Size on Two Identical Machines
    Cao, Qian
    Li, Yi
    Wan, Guohua
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (02)
  • [42] An optimal online algorithm for scheduling two machines with release times
    Noga, J
    Seiden, SS
    THEORETICAL COMPUTER SCIENCE, 2001, 268 (01) : 133 - 143
  • [43] OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION
    Jiang, Yiwei
    Zhang, An
    Hu, Jueliang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (01)
  • [44] Online algorithms for scheduling with machine activation cost on two uniform machines
    Shu-guang Han
    Yi-wei Jiang
    Jue-liang Hu
    Journal of Zhejiang University-SCIENCE A, 2007, 8 : 127 - 133
  • [46] Online algorithms for scheduling with machine activation cost on two uniform machines
    Han Shu-guang
    Jiang Yi-wei
    Hu Jue-liang
    JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2007, 8 (01): : 127 - 133
  • [47] Online Splitting Interval Scheduling on m Identical Machines
    Zheng, Feifeng
    Liu, Bo
    Xu, Yinfeng
    Zhang, E.
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 304 - +
  • [48] Online-Scheduling on identical machines with bounded migration
    Ehlers, Thorsten
    Jansen, Klaus
    2013 15TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2013), 2014, : 361 - 366
  • [49] Scheduling problems on two sets of identical machines
    Imreh, C
    COMPUTING, 2003, 70 (04) : 277 - 294
  • [50] Scheduling Problems on Two Sets of Identical Machines
    Csanád Imreh
    Computing, 2003, 70 : 277 - 294