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 条
  • [21] Batch scheduling of identical jobs on parallel identical machines
    Mor, Baruch
    Mosheiov, Gur
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (20) : 762 - 766
  • [22] Scheduling identical jobs on uniform machines with a conflict graph
    Mallek, Amin
    Bendraouche, Mohamed
    Boudhar, Mourad
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 357 - 366
  • [23] Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
    Lin, Ran
    Wang, Jun-Qiang
    Liu, Zhixin
    Xu, Jun
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) : 53 - 64
  • [24] SCHEDULING JOBS TO 2 MACHINES SUBJECT TO BATCH ARRIVAL ORDERING
    TAMIR, A
    [J]. NAVAL RESEARCH LOGISTICS, 1979, 26 (03) : 521 - 525
  • [25] Multiobjective scheduling of jobs with incompatible families on parallel batch machines
    Reichelt, Dirk
    Moench, Lars
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2006, 3906 : 209 - 221
  • [26] Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
    Li, Wenjie
    Zhang, Zhenkun
    Liu, Hailing
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (12) : 503 - 508
  • [27] Scheduling jobs online on linear hierarchical parallel machines
    [J]. Xin, Xiao, 2016, UK Simulation Society, Clifton Lane, Nottingham, NG11 8NS, United Kingdom (17):
  • [28] Approximation algorithms for scheduling multiple feasible interval jobs
    Chen, JJ
    Wu, J
    Shih, CS
    Kuo, TW
    [J]. 11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2005, : 11 - 16
  • [29] Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms
    Damodaran, Purushothaman
    Hirani, Neal S.
    Velez-Gallego, Mario C.
    [J]. EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2009, 3 (02) : 187 - 206
  • [30] Batch scheduling of identical jobs with controllable processing times
    Mor, Baruch
    Mosheiov, Gur
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 115 - 124
12345