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
来源：
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 条
  • [1] On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
    Ridouard, Frederic
    Richard, Pascal
    Martineau, Patrick
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1327 - 1342
  • [2] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    JOURNAL OF SCHEDULING, 2009, 12 (01) : 91 - 97
  • [3] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Ruyan Fu
    Ji Tian
    Jinjiang Yuan
    Journal of Scheduling, 2009, 12 : 91 - 97
  • [4] On-Line Scheduling on a Single Bounded Batch Processing Machine with Restarts
    Chen, Hua
    Zhang, Yuan-ping
    Yong, Xue-rong
    PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON EDUCATION TECHNOLOGY AND COMPUTER SCIENCE, VOL I, 2009, : 868 - +
  • [5] Online scheduling in a parallel batch processing system to minimize makespan using restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Lin, Yixun
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 196 - 202
  • [6] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Songsong Li
    Yuzhong Zhang
    Journal of Systems Science and Complexity, 2016, 29 : 472 - 477
  • [7] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Li Songsong
    Zhang Yuzhong
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (02) : 472 - 477
  • [8] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    LI Songsong
    ZHANG Yuzhong
    Journal of Systems Science & Complexity, 2016, 29 (02) : 472 - 477
  • [9] 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.
    JOURNAL OF SCHEDULING, 2011, 14 (04) : 361 - 369
  • [10] 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
    Journal of Scheduling, 2011, 14 : 361 - 369
12345