A best online algorithm for scheduling on two parallel batch machines

被引：10
|
作者：
Tian, Ji [1 ]
Fu, Ruyan [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 21-23期
基金：
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词：
Online scheduling; Parallel batch machines; Competitive ratio;
D O I：
10.1016/j.tcs.2009.02.011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the online scheduling on two parallel batch machines with infinite batch size to minimize makespan, where jobs arrive over time. That is, all information of a job is not available until it is released. For this online scheduling problem, Nong et al. [Q.Q. Nong. T.C.E. Cheng, C.T. Ng, An improved online algorithm for scheduling on two Unrestrictive parallel batch processing machines, Operations Research Letters, 36 (2008) 584-588] have provided an online algorithm with competitive ratio no greater than root 2. We show that this bound is tight for the problem. Furthermore we give a new best possible online algorithm with a tighter structure. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：2291 / 2294
页数：4
相关论文
共 50 条
  • [1] 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)
  • [2] A best possible on-line algorithm for scheduling on uniform parallel-batch machines
    Li, Wenhua
    Chai, Xing
    Song, Yali
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 740 : 68 - 75
  • [3] Online batch scheduling on parallel machines with delivery times
    Fang, Yang
    Lu, Xiwen
    Liu, Peihai
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5333 - 5339
  • [4] An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
    Jiang, Yiwei
    Zhou, Wei
    Zhou, Ping
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (03)
  • [5] A best possible online algorithm for parallel batch scheduling with delivery times and limited restart
    Liu, Hailing
    Lu, Xiwen
    Li, Wenjie
    [J]. OPTIMIZATION LETTERS, 2021, 15 (04) : 1155 - 1173
  • [6] A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
    Yuan, Jinjiang
    Fu, Ruyan
    Ng, C. T.
    Cheng, T. C. E.
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (04) : 361 - 369
  • [7] A best possible online algorithm for parallel batch scheduling with delivery times and limited restart
    Hailing Liu
    Xiwen Lu
    Wenjie Li
    [J]. Optimization Letters, 2021, 15 : 1155 - 1173
  • [8] A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
    Jinjiang Yuan
    Ruyan Fu
    C. T. Ng
    T. C. E. Cheng
    [J]. Journal of Scheduling, 2011, 14 : 361 - 369
  • [9] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
  • [10] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    [J]. Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
12345