Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan

被引：1
|
作者：
Li, Wenhua [1 ]
Gao, Jie [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China
来源：
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2015年 / 32卷 / 04期
关键词：
Online-list scheduling; parallel batching; makespan; competitive ratio; PROCESSING MACHINE; ALGORITHMS;
D O I：
10.1142/S0217595915500281
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the online-list scheduling on a single bounded parallel-batch machine to minimize makespan. In the problem, the jobs arrive online over list. The first unassigned job in the list should be assigned to a batch before the next job is released. Each batch can accommodate up to b jobs. For b = 2, we establish a lower bound 1 + gamma of competitive ratio and provide an online algorithm with a competitive ratio of root 5+1/2, where gamma is the positive root of gamma(gamma + 1)(2) = 1. For b = 3, we establish a lower bound 1 + alpha of competitive ratio and provide an online algorithm with a competitive ratio of 2, where a is the positive root of the equation (1 + alpha)(1 + alpha(2)) = 2.
引用
收藏
页数：15
相关论文
共 50 条
  • [41] Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
    He, Cheng
    Leung, Joseph Y. -T.
    Lee, Kangbok
    Pinedo, Michael L.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 204 : 150 - 163
  • [42] Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection
    Jin, Miaomiao
    Liu, Xiaoxia
    Luo, Wenchang
    [J]. MATHEMATICS, 2020, 8 (02)
  • [43] A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem
    Chou, Fuh-Der
    Chang, Pei-Chann
    Wang, Hui-Mei
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 31 (3-4): : 350 - 359
  • [44] A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem
    Chou, Fuh-Der
    Chang, Pei-Chann
    Wang, Hui-Mei
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 31 (3-4): : 350 - 359
  • [45] A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem
    Fuh-Der Chou
    Pei-Chann Chang
    Hui-Mei Wang
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 31 : 350 - 359
  • [46] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    [J]. JOURNAL OF SCHEDULING, 2009, 12 (01) : 91 - 97
  • [47] The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
    Nong, Q. Q.
    Ng, C. T.
    Cheng, T. C. E.
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 61 - 66
  • [48] Scheduling a capacitated batch-processing machine to minimize makespan
    Damodaran, Purushothaman
    Srihari, Krishnaswami
    Lam, Sarah S.
    [J]. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2007, 23 (02) : 208 - 216
  • [49] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Ruyan Fu
    Ji Tian
    Jinjiang Yuan
    [J]. Journal of Scheduling, 2009, 12 : 91 - 97
  • [50] Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
    He, Cheng
    Lin, Hao
    Han, Xinxin
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 322 : 94 - 101
12345