A 2.28-COMPETITIVE ALGORITHM FOR ONLINE SCHEDULING ON IDENTICAL MACHINES

被引：6
|
作者：
Tao, Jiping [1 ]
Huang, Ronghuan [1 ]
Liu, Tundong [1 ]
机构：
[1] Xiamen Univ, Dept Automat, Xiamen 361005, Peoples R China
来源：
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | 2015年 / 11卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Identical machines scheduling; online algorithms; competitive analysis; instance reduction; AVERAGE COMPLETION-TIME; SINGLE-MACHINE;
D O I：
10.3934/jimo.2015.11.185
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Online scheduling on identical machines is investigated in the setting where jobs arrive over time. The goal is to minimize the total completion time. A waiting strategy based online algorithm is designed and is proved to be 2.28-competitive. The result improves the current best online algorithm from the worse-case prospective.
引用
收藏
页码：185 / 198
页数：14
相关论文
共 50 条
  • [41] Online scheduling of parallel jobs on two machines is 2-competitive
    Hurink, J. L.
    Paulus, J. J.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 51 - 56
  • [42] AN IMPROVED 2.11-COMPETITIVE ALGORITHM FOR ONLINE SCHEDULING ON PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME
    Ma, Ran
    Tao, Jiping
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (02) : 497 - 510
  • [43] Batch scheduling of identical jobs on parallel identical machines
    Mor, Baruch
    Mosheiov, Gur
    INFORMATION PROCESSING LETTERS, 2012, 112 (20) : 762 - 766
  • [44] Mixed batch scheduling on identical machines
    Wang, Jun-Qiang
    Fan, Guo-Qiang
    Liu, Zhixin
    JOURNAL OF SCHEDULING, 2020, 23 (04) : 487 - 496
  • [45] Scheduling on identical machines with batch arrivals
    Chung, Tsui-Ping
    Liao, Ching-Jong
    Su, Ling-Huey
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 123 (01) : 179 - 186
  • [46] Malleable scheduling beyond identical machines
    Fotakis, Dimitris
    Matuschke, Jannik
    Papadigenopoulos, Orestis
    Leibniz International Proceedings in Informatics, LIPIcs, 2019, 145
  • [47] Malleable scheduling beyond identical machines
    Dimitris Fotakis
    Jannik Matuschke
    Orestis Papadigenopoulos
    Journal of Scheduling, 2023, 26 : 425 - 442
  • [48] Malleable scheduling beyond identical machines
    Fotakis, Dimitris
    Matuschke, Jannik
    Papadigenopoulos, Orestis
    JOURNAL OF SCHEDULING, 2023, 26 (05) : 425 - 442
  • [49] Mixed batch scheduling on identical machines
    Jun-Qiang Wang
    Guo-Qiang Fan
    Zhixin Liu
    Journal of Scheduling, 2020, 23 : 487 - 496
  • [50] A GPU Parallel Approximation Algorithm for Scheduling Parallel Identical Machines to Minimize Makespan
    Li, Yuanzhe
    Ghalami, Laleh
    Schwiebert, Loren
    Grosu, Daniel
    2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 619 - 628
12345