On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

被引：18
|
作者：
Fu, Ruyan [1 ]
Tian, Ji [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2009年 / 12卷 / 01期
关键词：
On-line scheduling; Batch machine; Job families; Competitive ratio; PROCESSING MACHINES; ALGORITHMS;
D O I：
10.1007/s10951-008-0084-6
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We study the on-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. In this model, jobs arrive over time and jobs from different families cannot be scheduled in a common batch. We provide a best possible on-line algorithm for the problem with competitive ratio (root 17+ 3)/4 approximate to 1.7808.
引用
收藏
页码：91 / 97
页数：7
相关论文
共 50 条
  • [1] 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
  • [2] On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
    Ridouard, Frederic
    Richard, Pascal
    Martineau, Patrick
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1327 - 1342
  • [3] The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
    Yuan, JJ
    Liu, ZH
    Ng, CT
    Cheng, TCE
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 199 - 212
  • [4] 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
  • [5] On-line scheduling on a batch machine to minimize makespan with limited restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    He, Cheng
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (02) : 255 - 258
  • [6] Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Li, Ya
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 179 - 184
  • [7] The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
    Lu, Lingfa
    Zhang, Liqi
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 283 - 289
  • [8] Unbounded parallel batch scheduling with job delivery to minimize makespan
    Lu, Lingfa
    Yuan, Jinjiang
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (04) : 477 - 480
  • [9] 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
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) : 435 - 440
  • [10] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Li Songsong
    Zhang Yuzhong
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (02) : 472 - 477
12345