Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart

被引：8
|
作者：
Liu, Hailing [1 ,2 ]
Yuan, Jinjiang [1 ]
Li, Wenjie [3 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
[2] Henan Inst Engn, Coll Sci, Zhengzhou 451191, Henan, Peoples R China
[3] Luoyang Normal Univ, Sch Math Sci, Luoyang 471022, Henan, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2016年 / 31卷 / 04期
关键词：
Online scheduling; Limited restart; Unit length jobs; Restricted batch; SINGLE-MACHINE; SEMICONDUCTOR INDUSTRY; MINIMIZE MAKESPAN; ALGORITHMS; TIME; SYSTEM; MODELS;
D O I：
10.1007/s10878-015-9844-3
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We consider the online scheduling of equal length jobs on unbounded parallel batch processing machines to minimize makespan with limited restart. In the problem identical unbounded parallel batch processing machines are available to process the equal length jobs arriving over time. The processing batches are allowed limited restart. Here, "restart" means that a running task may be interrupted, losing all the work done on it, and the jobs in the interrupted task are then released and become independently unscheduled jobs, called restarted jobs. "Limited restart" means that only a running batch that contains no restarted jobs can be restarted. For this problem, we present a best possible online algorithm.
引用
收藏
页码：1609 / 1622
页数：14
相关论文
共 50 条
  • [1] 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
  • [2] Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
    Liu, Hailing
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 543 : 24 - 36
  • [3] Online scheduling of equal-length jobs on parallel machines
    Ding, Jihuan
    Ebenlendr, Tomas
    Sgall, Jiri
    Zhang, Guochuan
    [J]. ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 427 - +
  • [4] 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)
  • [5] Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery
    Liu, Qijia
    Yuan, Jinjiang
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (04)
  • [6] 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 - +
  • [7] Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
    Xin, Xiao
    Khan, Muhammad Ijaz
    Li, Shuguang
    [J]. OPEN MATHEMATICS, 2023, 21 (01):
  • [8] 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
  • [9] 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
  • [10] Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
    Krumke, Sven O.
    Taudes, Alfred
    Westphal, Stephan
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (08) : 1103 - 1108
12345