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 条
  • [31] Semi-online scheduling with machine cost
    Yong He
    Shengyi Cai
    Journal of Computer Science and Technology, 2002, 17 : 781 - 787
  • [32] Semi-online scheduling with machine cost
    He, Y
    Cai, SY
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2002, 17 (06) : 781 - 787
  • [33] Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
    Liu, Ming
    Zheng, Feifeng
    Zhu, Zhanguo
    Chu, Chengbin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (05)
  • [34] Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
    Qi, Xianglai
    Yuan, Jinjiang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2019, 36 (01)
  • [35] Algorithms better than LPT for semi-online scheduling with decreasing processing times
    Cheng, T. C. E.
    Kellerer, Hans
    Kotov, Vladimir
    OPERATIONS RESEARCH LETTERS, 2012, 40 (05) : 349 - 352
  • [36] Minimizing Total Weighted Completion Times for Semi-online Single Machine Scheduling
    Nouinou, H.
    Arbaoui, T.
    Yalaoui, A.
    IFAC PAPERSONLINE, 2022, 55 (10): : 2191 - 2196
  • [37] LS Algorithm for Semi-online Scheduling Jobs with Nondecreasing Release Times and Nondecreasing Processing Times
    Tang, F.
    Nie, J.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL APPLICATIONS (CISIA 2015), 2015, 18 : 569 - 572
  • [38] Semi-online scheduling for jobs with release times
    Rongheng Li
    Liying Yang
    Xiaoqiong He
    Qiang Chen
    Xiayan Cheng
    Journal of Combinatorial Optimization, 2013, 26 : 448 - 464
  • [39] The problem of three machines with indeterminate times of processing
    Levin, VI
    AUTOMATION AND REMOTE CONTROL, 1996, 57 (01) : 89 - 97
  • [40] The Problem of Three Machines with Indeterminate Times of Processing
    Levin, V. I.
    Automation and Remote Control (English translation of Avtomatika i Telemekhanika), 1996, 57 (02):
12345