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 条
  • [21] An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1191 - 1210
  • [22] Single machine batch scheduling with release times and delivery costs
    Selvarajah, Esaignani
    Steiner, George
    Zhang, Rui
    JOURNAL OF SCHEDULING, 2013, 16 (01) : 69 - 79
  • [23] Single machine batch scheduling with release times and delivery costs
    Esaignani Selvarajah
    George Steiner
    Rui Zhang
    Journal of Scheduling, 2013, 16 : 69 - 79
  • [24] Online Scheduling on a Parallel-Batch Machine With Pulse Interruptions
    Lin, Ran
    Wang, Jun-Qiang
    Liu, Zhixin
    Xu, Jun
    NAVAL RESEARCH LOGISTICS, 2025,
  • [25] Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
    Ali Kordmostafapour
    Javad Rezaeian
    Iraj Mahdavi
    Mahdi Yar Farjad
    OPSEARCH, 2022, 59 : 1438 - 1470
  • [26] Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost
    Kordmostafapour, Ali
    Rezaeian, Javad
    Mahdavi, Iraj
    Farjad, Mahdi Yar
    OPSEARCH, 2022, 59 (04) : 1438 - 1470
  • [27] A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
    Jinjiang Yuan
    Shisheng Li
    Ji Tian
    Ruyan Fu
    Journal of Combinatorial Optimization, 2009, 17 : 206 - 213
  • [28] A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
    Yuan, Jinjiang
    Li, Shisheng
    Tian, Ji
    Fu, Ruyan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 17 (02) : 206 - 213
  • [29] Scheduling jobs with sizes and delivery times on identical parallel batch machines
    Li, Yijie
    Li, Shuguang
    THEORETICAL COMPUTER SCIENCE, 2020, 841 : 1 - 9
  • [30] ANALYSIS OF HEURISTICS FOR PREEMPTIVE PARALLEL MACHINE SCHEDULING WITH BATCH SETUP TIMES
    MONMA, CL
    POTTS, CN
    OPERATIONS RESEARCH, 1993, 41 (05) : 981 - 993
12345