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 条
  • [11] Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
    Li, Shuguang
    [J]. MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (11) : 10731 - 10740
  • [12] Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
    Li, Wenjie
    Li, Shisheng
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2015, 46 (04) : 652 - 661
  • [13] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    Liu, L. L.
    Ng, C. T.
    Cheng, T. C. E.
    [J]. OPTIMIZATION LETTERS, 2014, 8 (01) : 307 - 318
  • [14] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    L. L. Liu
    C. T. Ng
    T. C. E. Cheng
    [J]. Optimization Letters, 2014, 8 : 307 - 318
  • [15] Online scheduling of jobs with favorite machines
    Chen, Cong
    Penna, Paolo
    Xu, Yinfeng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 116
  • [16] Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
    Zhou, Hao
    Zhou, Ping
    Jiang, Yiwei
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (05)
  • [17] Optimal on-line algorithms for scheduling on parallel batch processing machines
    Zhang, GC
    Cai, XQ
    Wong, CK
    [J]. IIE TRANSACTIONS, 2003, 35 (02) : 175 - 181
  • [18] Scheduling jobs on identical machines with agreement graph
    Bendraouche, Mohamed
    Boudhar, Mourad
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (02) : 382 - 390
  • [19] Learning Priority Indices for Energy-Aware Scheduling of Jobs on Batch Processing Machines
    Schorn, Daniel Sascha
    Moench, Lars
    [J]. IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2024, 37 (01) : 3 - 15
  • [20] ELECTRICITY POWER COST-AWARE SCHEDULING OF JOBS ON PARALLEL BATCH PROCESSING MACHINES
    Rocholl, Jens
    Moench, Lars
    Fowler, John W.
    [J]. 2018 WINTER SIMULATION CONFERENCE (WSC), 2018, : 3420 - 3431
12345