Online and Semi-Online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work

被引：0
|
作者：
Xiao, Man [1 ]
Liu, Xiaoqiao [1 ]
Li, Weidong [1 ]
Chen, Xin [2 ]
Sterna, Malgorzata [3 ]
Blazewicz, Jacek [3 ,4 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Kunming 650504, Peoples R China
[2] Liaoning Univ Technol, Sch Elect & Informat Engn, Shiying 169, Jinzhou 121001, Peoples R China
[3] Poznan Univ Tech, Inst Comp Sci, Ul Piotrowo 2, PL-60965 Poznan, Poland
[4] Polish Acad Sci, European Ctr Bioinformat & Genom, Ul Piotrowo 2, PL-60965 Poznan, Poland
来源：
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE | 2024年 / 34卷 / 02期
基金：
中国国家自然科学基金;
关键词：
online and semi-online; early work; hierarchical scheduling; competitive ratio; IDENTICAL MACHINES; PARALLEL MACHINES;
D O I：
10.61822/amcs-2024-0018
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this study, we investigate several online and semi-online scheduling problems related to two hierarchical machines with a common due date to maximize the total early work. For the pure online case, we design an optimal online algorithm with a competitive ratio of root 2. Additionally, for the cases when the largest processing time is known, we give optimal algorithms with a competitive ratio of 6/5 if the largest job is a lower-hierarchy one, and of root 5 - 1 if the largest job is a higher-hierarchy one.
引用
收藏
页码：253 / 261
页数：9
相关论文
共 50 条
  • [31] Optimal preemptive semi-online scheduling to minimize makespan on two related machines
    Epstein, L
    Favrholdt, LM
    [J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (04) : 269 - 275
  • [32] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    He, Y
    Jiang, Y
    [J]. ACTA INFORMATICA, 2004, 40 (05) : 367 - 383
  • [33] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Taibo Luo
    Yinfeng Xu
    [J]. Optimization Letters, 2016, 10 : 207 - 213
  • [34] Semi-online scheduling problems on two identical machines with inexact partial information
    Tan, Zhiyi
    He, Yong
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 110 - 125
  • [35] Several semi-online scheduling problems on two identical machines with combined information
    Cao, Qian
    Cheng, T. C. E.
    Wan, Guohua
    Li, Yi
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 457 : 35 - 44
  • [36] Semi-online scheduling on two uniform processors
    Angelelli, Enrico
    Speranza, Maria Grazia
    Tuza, Zsolt
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 393 (1-3) : 211 - 219
  • [37] Semi-online scheduling with known maximum job size on two uniform machines
    Qian Cao
    Zhaohui Liu
    [J]. Journal of Combinatorial Optimization, 2010, 20 : 369 - 384
  • [38] Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
    Liu, Ming
    Zheng, Feifeng
    Zhu, Zhanguo
    Chu, Chengbin
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (05)
  • [39] On-line and semi-online scheduling for flow shop problems on two machines
    Yang, Ming
    Lu, Xiwen
    [J]. OPTIMIZATION, 2013, 62 (04) : 499 - 507
  • [40] Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
    Min, Xiao
    Liu, Jing
    Wang, Yuqing
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (09) : 423 - 428
12345