Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date

被引：0
|
作者：
Xiao, Man [1 ]
Li, Weidong [1 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Kunming 650504, Yunnan, Peoples R China
来源：
FRONTIERS OF ALGORITHMIC WISDOM, IJTCS-FAW 2022 | 2022年 / 13461卷
基金：
中国国家自然科学基金;
关键词：
Online; Early work; Hierarchy; Competitive ratio; PARALLEL IDENTICAL MACHINES; SEMI; ALGORITHMS; GRADE;
D O I：
10.1007/978-3-031-20796-9_8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we consider the online early work problems on three hierarchical machines with a common due date. When there is one machine of hierarchy 1, we propose an optimal online algorithm with a competitive ratio of 1.302. When there are two machines of hierarchy 1, we give a lower bound 1.276, and propose an online algorithm with a competitive ratio of 1.302.
引用
收藏
页码：99 / 109
页数：11
相关论文
共 50 条
  • [1] 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
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2024, 34 (02) : 253 - 261
  • [2] Semi-online scheduling on two identical machines with a common due date to maximize total early work
    Chen, Xin
    Kovalev, Sergey
    Liu, Yuqing
    Sterna, Malgorzata
    Chalamon, Isabelle
    Blazewicz, Jacek
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 290 (290) : 71 - 78
  • [3] Alternative algorithms for identical machines scheduling to maximize total early work with a common due date
    Chen, Xin
    Shen, Xuefeng
    Kovalyov, Mikhail Y.
    Sterna, Malgorzata
    Blazewicz, Jacek
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 171
  • [4] Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
    Wei-Dong Li
    [J]. Journal of the Operations Research Society of China, 2024, 12 : 341 - 350
  • [5] Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
    Li, Wei-Dong
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024, 12 (02) : 341 - 350
  • [6] Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
    Chen, Xin
    Liang, Yage
    Sterna, Malgorzata
    Wang, Wen
    Blazewicz, Jacek
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (01) : 67 - 74
  • [7] Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
    Man Xiao
    Xiaoqiao Liu
    Weidong Li
    [J]. Journal of Combinatorial Optimization, 2023, 46
  • [8] Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time
    Xiao, Man
    Liu, Xiaoqiao
    Li, Weidong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 46 (03)
  • [9] Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work
    Malgorzata Sterna
    Kateryna Czerniachowska
    [J]. Journal of Optimization Theory and Applications, 2017, 174 : 927 - 944
  • [10] Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work
    Sterna, Malgorzata
    Czerniachowska, Kateryna
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 927 - 944
12345