Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

被引：1
|
作者：
Miao, Cuixia [1 ,2 ]
机构：
[1] Qufu Normal Univ, Sch Math Sci, Qufu 273165, Shandong, Peoples R China
[2] Qufu Normal Univ, Sch Phys & Engn, Qufu 273165, Shandong, Peoples R China
来源：
ABSTRACT AND APPLIED ANALYSIS | 2014年
基金：
中国国家自然科学基金;
关键词：
PROCESSING TIMES; SINGLE; JOBS;
D O I：
10.1155/2014/495187
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is p(j) = a(j) + alpha t and of the second model is p(j) = a + alpha(j)t The objective is to minimize the makespan. We present O(nlogn) time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.
引用
收藏
页数：10
相关论文
共 50 条
  • [1] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
  • [2] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
  • [3] Online scheduling on unbounded parallel-batch machines to minimize the makespan
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    INFORMATION PROCESSING LETTERS, 2009, 109 (21-22) : 1211 - 1215
  • [4] Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
    Li, Shisheng
    Ng, C. T.
    Cheng, T. C. E.
    Yuan, Jinjiang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) : 482 - 488
  • [5] 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)
  • [6] 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
  • [7] 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
  • [8] Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Li, Ya
    INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 179 - 184
  • [9] 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)
  • [10] A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
    Gao, Yuan
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 74 - 81
12345