Online Scheduling on a Parallel Batch Machine with Delivery Times and Limited Restarts

被引：0
|
作者：
Hai-Ling Liu
Xi-Wen Lu
机构：
[1] East China University of Science and Technology,Department of Mathematics
[2] Henan University of Engineering,College of Science
来源：
Journal of the Operations Research Society of China | 2022年 / 10卷
关键词：
Online scheduling; Parallel batch; Limited restart; Delivery time; 90B35;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The online scheduling on an unbounded parallel batch machine with delivery times and limited restarts is studied in this paper. Here, online means that jobs arrive over time and the characteristics of a job become known until it arrives. Limited restarts mean that once a running batch contains at least one restarted job, it cannot be restarted again. The goal is to minimize the time by which all jobs have been delivered. We consider a restricted model that the delivery time of each job is no more than its processing time. We present a best possible online algorithm with a competitive ratio of 3/2 for the problem.
引用
收藏
页码：113 / 131
页数：18
相关论文
共 50 条
  • [11] Online scheduling in a parallel batch processing system to minimize makespan using restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Lin, Yixun
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 196 - 202
  • [12] Parallel machine scheduling with batch delivery costs
    Wang, GQ
    Cheng, TCE
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 68 (02) : 177 - 183
  • [13] Note on "parallel machine scheduling with batch setup times"
    Webster, S
    OPERATIONS RESEARCH, 1998, 46 (03) : 423 - 423
  • [14] 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.
    JOURNAL OF SCHEDULING, 2011, 14 (04) : 361 - 369
  • [15] 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
    Journal of Scheduling, 2011, 14 : 361 - 369
  • [16] HEURISTICS FOR PARALLEL MACHINE SCHEDULING WITH DELIVERY TIMES
    WOEGINGER, GJ
    ACTA INFORMATICA, 1994, 31 (06) : 503 - 512
  • [17] Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
    Liu, Hailing
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2014, 543 : 24 - 36
  • [18] HEURISTICS FOR PARALLEL MACHINE SCHEDULING WITH BATCH DELIVERY CONSIDERATION
    Wang, Leiyang
    Liu, Zhaohui
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (01) : 259 - 273
  • [19] Parallel Machine Scheduling with Batch Delivery to Two Customers
    Zhong, Xueling
    Jiang, Dakui
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [20] Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
    Fu, Ruyan
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    INFORMATION PROCESSING LETTERS, 2010, 110 (11) : 444 - 450
12345