On-line scheduling on a batch machine to minimize makespan with limited restarts

被引：17
|
作者：
Fu, Ruyan [1 ]
Tian, Ji [1 ]
Yuan, Jinjiang [1 ]
He, Cheng [1 ,2 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Peoples R China
[2] Informat Engn Univ PLA, Inst Sci, Henan 450051, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 02期
基金：
中国国家自然科学基金;
关键词：
on-line scheduling; batch machine; restart; competitive ratio;
D O I：
10.1016/j.orl.2007.07.001
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We study the on-line scheduling on an unbounded batch machine to minimize makespan. In this model, jobs arrive over time and batches are allowed limited restarts. Any batch that contains a job which has already been restarted once cannot be restarted any more. We provide a best possible on-line algorithm for the problem with a competitive ratio 3/2. (C) 2007 Published by Elsevier B.V.
引用
收藏
页码：255 / 258
页数：4
相关论文
共 50 条
  • [21] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
    Lin, BMT
    Cheng, TCE
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624
  • [22] Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
    Ji, Min
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (01) : 90 - 98
  • [23] Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
    Zhang, Han
    Lu, Lingfa
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (01)
  • [24] The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan
    Nong, Qingqin
    Yuan, Jinjiang
    Fu, Ruyan
    Lin, Lin
    Tian, Ji
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) : 435 - 440
  • [25] Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
    Du D.-L.
    Acta Mathematicae Applicatae Sinica, 2005, 21 (3) : 485 - 488
  • [26] Minimizing makespan in batch machine scheduling
    Poon, CK
    Zhang, PX
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 386 - 397
  • [27] Minimizing makespan in batch machine scheduling
    Poon, CK
    Zhang, PX
    ALGORITHMICA, 2004, 39 (02) : 155 - 174
  • [28] Minimizing Makespan in Batch Machine Scheduling
    Chung Keung Poon
    Pixing Zhang
    Algorithmica , 2004, 39 : 155 - 174
  • [29] A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem
    Fuh-Der Chou
    Pei-Chann Chang
    Hui-Mei Wang
    The International Journal of Advanced Manufacturing Technology, 2006, 31 : 350 - 359
  • [30] A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem
    Chou, Fuh-Der
    Chang, Pei-Chann
    Wang, Hui-Mei
    International Journal of Advanced Manufacturing Technology, 2006, 31 (3-4): : 350 - 359
12345