Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan

被引：1
|
作者：
Fu, Ruyan [1 ]
Tian, Ji [1 ]
Yuan, Jinjiang [2 ]
Li, Ya [2 ]
机构：
[1] China Univ Min & Technol, Coll Sci, Xuzhou 221116, Jiangsu, Peoples R China
[2] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2014年 / 114卷 / 04期
关键词：
Scheduling; Online algorithm; Makespan; Parallel batch machine; PROCESSING MACHINES; ALGORITHMS;
D O I：
10.1016/j.ipl.2013.11.016
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. In the problem, the jobs arrive online over time and to be processed on two machines M-1 and M-2. M-1 is an unbounded parallel-batch machine and M-2 is a standard machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. For this problem, we present an online algorithm of competitive ratio 5+root 5/4 approximate to 1.809. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：179 / 184
页数：6
相关论文
共 50 条
  • [1] Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
    Zhang, Han
    Lu, Lingfa
    Yuan, Jinjiang
    [J]. Journal of Combinatorial Optimization, 2025, 49 (01)
  • [2] Online scheduling on unbounded parallel-batch machines to minimize the makespan
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (21-22) : 1211 - 1215
  • [3] SCHEDULING FAMILY JOBS ON AN UNBOUNDED PARALLEL-BATCH MACHINE TO MINIMIZE MAKESPAN AND MAXIMUM FLOW TIME
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (04) : 1479 - 1500
  • [4] Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
    Li, Wenhua
    Gao, Jie
    Yuan, Jinjiang
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
  • [5] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    [J]. Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
  • [6] 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.
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (04) : 361 - 369
  • [7] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
  • [8] 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
    [J]. Journal of Scheduling, 2011, 14 : 361 - 369
  • [9] Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
    Li, Shuguang
    Geng, Zhichao
    [J]. INFORMATION PROCESSING LETTERS, 2023, 180
  • [10] Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
    Fang, Yang
    Lu, Xiwen
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (08) : 526 - 531
12345