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 条
  • [31] Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
    Lin, Ran
    Wang, Jun-Qiang
    Liu, Zhixin
    Xu, Jun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) : 53 - 64
  • [32] Optimal semi-online scheduling algorithms on a small number of machines
    Wu, Yong
    Tan, Zhiyi
    Yang, Qifan
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 504 - +
  • [33] Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
    Liu, Ming
    Chu, Chengbin
    Xu, Yinfeng
    Zheng, Feifeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (01) : 138 - 149
  • [34] Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
    Ming Liu
    Chengbin Chu
    Yinfeng Xu
    Feifeng Zheng
    Journal of Combinatorial Optimization, 2011, 21 : 138 - 149
  • [35] Exact and heuristic algorithms for scheduling on two identical machines with early work maximization
    Chen, Xin
    Wang, Wen
    Xie, Pengyu
    Zhang, Xingong
    Sterna, Malgorzata
    Blazewicz, Jacek
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 144
  • [36] Semi-online scheduling with combined information on two identical machines in parallel
    Qian Cao
    Guohua Wan
    Journal of Combinatorial Optimization, 2016, 31 : 686 - 695
  • [37] Semi-online scheduling with combined information on two identical machines in parallel
    Cao, Qian
    Wan, Guohua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 686 - 695
  • [38] Online Nonpreemptive Scheduling of Equal-Length Jobs on Two Identical Machines
    Goldwasser, Michael H.
    Pedigo, Mark
    ACM TRANSACTIONS ON ALGORITHMS, 2008, 5 (01)
  • [39] Online scheduling on two parallel identical machines with a non-clairvoyant disruption
    Zheng, Feifeng
    Wei, Honglong
    Xu, Yinfeng
    Liu, Ming
    COMPUTER-AIDED DESIGN, MANUFACTURING, MODELING AND SIMULATION, PTS 1-2, 2011, 88-89 : 264 - +
  • [40] Online scheduling of malleable parallel jobs with setup times on two identical machines
    Guo, Shouwei
    Kang, Liying
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (03) : 555 - 561
12345