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 条
  • [1] Optimal online algorithms for scheduling on two identical machines under a grade of service
    Jiang Y.-W.
    He Y.
    Tang C.-M.
    Journal of Zhejiang University-SCIENCE A, 2006, 7 (3): : 309 - 314
  • [2] Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
    Wu, Yong
    Ji, Min
    Yang, Qifan
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 135 (01) : 367 - 371
  • [3] Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision
    Wu, Yong
    Yang, Qifan
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 261 - +
  • [4] Online scheduling of two identical machines under a grade of service provision
    Cai, Shuang
    Liu, Ao
    Liu, Ke
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 2718 - 2722
  • [5] Online Scheduling on Two Parallel Identical Machines Under a Grade of Service Provision
    Cai, Shuang
    Liu, Ke
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2022, 10 (04) : 689 - 702
  • [6] Online Scheduling on Two Parallel Identical Machines Under a Grade of Service Provision
    Shuang Cai
    Ke Liu
    Journal of the Operations Research Society of China, 2022, 10 : 689 - 702
  • [7] Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
    Min, Xiao
    Liu, Jing
    Wang, Yuqing
    INFORMATION PROCESSING LETTERS, 2011, 111 (09) : 423 - 428
  • [8] Online and semi-online scheduling of two machines under a grade of service provision
    Park, Jongho
    Chang, Soo Y.
    Lee, Kangbok
    OPERATIONS RESEARCH LETTERS, 2006, 34 (06) : 692 - 696
  • [9] Optimal online algorithms for MapReduce scheduling on two uniform machines
    Jiang, Yiwei
    Zhou, Ping
    Cheng, T. C. E.
    Ji, Min
    OPTIMIZATION LETTERS, 2019, 13 (07) : 1663 - 1676
  • [10] Optimal online algorithms for MapReduce scheduling on two uniform machines
    Yiwei Jiang
    Ping Zhou
    T. C. E. Cheng
    Min Ji
    Optimization Letters, 2019, 13 : 1663 - 1676
12345