Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs

被引：5
|
作者：
Wang, Qian [1 ]
Tian, Ji [1 ]
Fu, Ruyan [1 ]
Yao, Xiangjuan [1 ]
机构：
[1] China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2017年 / 700卷
关键词：
Online scheduling; Batch machine; Compatibility graph; Competitive ratio; MINIMIZE MAKESPAN;
D O I：
10.1016/j.tcs.2017.07.022
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the online (over time) scheduling problem of minimizing the makespan on m unbounded parallel-batch machines, in which jobs in the same batch have to be pairwise compatible. Compatibility is a symmetric binary relation, which is represented by an interval compatibility graph. The processing time of a batch is equal to the maximum processing time of the jobs in it, and all jobs in the same batch start and finish at the same time. For this problem, firstly, we show that there exists no online algorithm with a competitive ratio less than 2. Then we provide an online algorithm with a competitive ratio 2 + m-1/m+1, which is optimal for the case m = 1. When all jobs have the same processing times, we also give an optimal online algorithm. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：37 / 44
页数：8
相关论文
共 50 条
  • [1] Batch processing with interval graph compatibilities between tasks
    Finke, Gerd
    Jost, Vincent
    Queyranne, Maurice
    Sebo, Andras
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (05) : 556 - 568
  • [2] Scheduling Jobs on Parallel Batch Processing Machines
    Liu, Lili
    Wang, Jibo
    Zhang, Feng
    [J]. 2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL I, 2009, : 78 - +
  • [3] Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
    Li, Wenhua
    Zhang, Zhenkun
    Yang, Sufang
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (07) : 292 - 297
  • [4] Scheduling Jobs on Batch Machines Based on Ant Colony Algorithms
    Huang, XiaBao
    [J]. APPLIED MECHANICS, MATERIALS AND MANUFACTURING IV, 2014, 670-671 : 1522 - 1525
  • [5] Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
    Hailing Liu
    Jinjiang Yuan
    Wenjie Li
    [J]. Journal of Combinatorial Optimization, 2016, 31 : 1609 - 1622
  • [6] Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
    Liu, Hailing
    Yuan, Jinjiang
    Li, Wenjie
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1609 - 1622
  • [7] Scheduling jobs with release dates on parallel batch processing machines
    Liu, L. L.
    Ng, C. T.
    Cheng, T. C. E.
    [J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) : 1825 - 1830
  • [8] Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
    Jiao, Chengwen
    Yuan, Jinjiang
    Feng, Qi
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2019, 36 (05)
  • [9] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Fu, Ruyan
    Tian, Ji
    Li, Shisheng
    Yuan, Jinjiang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1187 - 1197
  • [10] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Ruyan Fu
    Ji Tian
    Shisheng Li
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2017, 34 : 1187 - 1197
12345