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 条
  • [1] Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times
    Wu, Gangxiong
    Li, Weidong
    THEORETICAL COMPUTER SCIENCE (NCTCS 2018), 2018, 882 : 1 - 7
  • [2] Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times
    Luo, Taibo
    Xu, Yinfeng
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 231 - 240
  • [3] Semi-online hierarchical load balancing problem with bounded processing times
    Luo, Taibo
    Xu, Yinfeng
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 75 - 82
  • [4] Optimal algorithms for semi-online machine covering on two hierarchical machines
    Wu, Yong
    Cheng, T. C. E.
    Ji, Min
    THEORETICAL COMPUTER SCIENCE, 2014, 531 : 37 - 46
  • [5] Semi-online machine covering for two uniform machines
    Chen, Xingyu
    Epstein, Leah
    Tan, Zhiyi
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5047 - 5062
  • [6] A SEMI-ONLINE ALGORITHM AND ITS COMPETITIVE ANALYSIS FOR A SINGLE MACHINE SCHEDULING PROBLEM WITH BOUNDED PROCESSING TIMES
    Tao, Jiping
    Chao, Zhijun
    Xi, Yugeng
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2010, 6 (02) : 269 - 282
  • [7] Semi-online machine covering
    Cai, Sheng-Yi
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (03) : 373 - 382
  • [8] 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
  • [9] A HYBRID GENETIC ALGORITHM FOR THE K-BOUNDED SEMI-ONLINE BIN COVERING PROBLEM IN BATCHING MACHINES
    Hundscheid, Bert H. H.
    Peeters, Kay
    Adan, Jelle
    Martagan, Tugce
    Adan, Ivo J. B. F.
    2019 WINTER SIMULATION CONFERENCE (WSC), 2019, : 2142 - 2153
  • [10] 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
12345