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

被引:16
|
作者
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
基金
中国国家自然科学基金;
关键词
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 条
  • [31] 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
  • [32] SINGLE MACHINE BATCH SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH CONTROLLABLE SETUP AND JOBS PROCESSING TIMES
    Luo, Chengxin
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (01): : 71 - 77
  • [33] Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
    Geng, Zhichao
    Yuan, Jinjiang
    Yuan, Junling
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 332 : 1 - 18
  • [34] Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
    Li, Wenhua
    Gao, Jie
    Yuan, Jinjiang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
  • [35] Family scheduling with batch availability in flow shops to minimize makespan
    Shen, Liji
    Gupta, Jatinder N. D.
    JOURNAL OF SCHEDULING, 2018, 21 (02) : 235 - 249
  • [36] Unbounded parallel batch scheduling with job delivery to minimize makespan
    Lu, Lingfa
    Yuan, Jinjiang
    OPERATIONS RESEARCH LETTERS, 2008, 36 (04) : 477 - 480
  • [37] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    J. J. Yuan
    Z. H. Liu
    C. T. Ng
    T. C. E. Cheng
    Journal of Scheduling, 2006, 9 : 499 - 513
  • [38] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    Yuan, J. J.
    Liu, Z. H.
    Ng, C. T.
    Cheng, T. C. E.
    JOURNAL OF SCHEDULING, 2006, 9 (06) : 499 - 513
  • [39] On-line scheduling algorithms for a batch machine with finite capacity
    Poon, CK
    Yu, WC
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (02) : 167 - 186
  • [40] On-line scheduling with delivery time on a single batch machine
    Tian, Ji
    Fu, Ruyan
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 49 - 57