Semi-online Machine Covering Problem on Three Hierarchical Machines with Bounded Processing Times

被引：0
|
作者：
Xiao, Man [1 ]
Du, Yu-Fei [1 ,2 ]
Li, Wei-Dong [1 ]
Yang, Jin-Hua [2 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Kunming 650504, Yunnan, Peoples R China
[2] Yunnan Univ, Dianchi Coll, Kunming 650228, Yunnan, Peoples R China
来源：
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA | 2024年 / 12卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Semi-online; Machine covering; Hierarchy; Competitive ratio; PARALLEL MACHINES; ALGORITHMS;
D O I：
10.1007/s40305-023-00477-1
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the problem of semi-online machine covering on three machines with two hierarchies, whose objective is to maximize the minimum machine load. Since there is no online algorithm with bounded competitive ratio for the online machine covering problem, we consider the semi-online case where the processing times of all jobs lie in [1, a]. When there are one machine of hierarchy 1 and two machines of hierarchy 2, we design an optimal online algorithm with a competitive ratio of 1 + a. When there are two machines of hierarchy 1 and one machine of hierarchy 2, we give an optimal online algorithm with a competitive ratio of 1 + 2a.
引用
收藏
页码：1126 / 1138
页数：13
相关论文
共 50 条
  • [41] A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times
    Xiao, Man
    Li, Weidong
    THEORETICAL COMPUTER SCIENCE, NCTCS 2022, 2022, 1693 : 209 - 215
  • [42] Semi-online scheduling for jobs with release times
    Li, Rongheng
    Yang, Liying
    He, Xiaoqiong
    Chen, Qiang
    Cheng, Xiayan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (03) : 448 - 464
  • [43] Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem
    Yang, Yaru
    Xiao, Man
    Li, Weidong
    COMPUTATION, 2024, 12 (04)
  • [44] Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time
    Luo, Taibo
    Xu, Yinfeng
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [45] Semi-online scheduling problems on a small number of machines
    Lee, Kangbok
    Lim, Kyungkuk
    JOURNAL OF SCHEDULING, 2013, 16 (05) : 461 - 477
  • [46] Semi-online scheduling on two identical machines with rejection
    Min, Xiao
    Wang, Yuqing
    Liu, Jing
    Jiang, Min
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (03) : 472 - 479
  • [47] Online and Semi-Online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work
    Xiao, Man
    Liu, Xiaoqiao
    Li, Weidong
    Chen, Xin
    Sterna, Malgorzata
    Blazewicz, Jacek
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2024, 34 (02) : 253 - 261
  • [48] Semi-online algorithms for scheduling with machine cost
    Jiang, Yi-Wei
    He, Yong
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (06) : 984 - 988
  • [49] Semi-Online Algorithms for Scheduling with Machine Cost
    Yi-Wei Jiang
    Yong He
    Journal of Computer Science and Technology, 2006, 21 : 984 - 988
  • [50] Resource augmented semi-online bounded space bin packing
    Epstein, Leah
    Kleiman, Elena
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (13) : 2785 - 2798
12345