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 条
  • [31] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    L. L. Liu
    C. T. Ng
    T. C. E. Cheng
    Optimization Letters, 2014, 8 : 307 - 318
  • [32] Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
    Li, Wenhua
    Yuan, Jinjiang
    INFORMATION PROCESSING LETTERS, 2011, 111 (18) : 907 - 911
  • [33] Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
    Miao, Cuixia
    Zhang, Yuzhong
    Wang, Chengfei
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 220 - 228
  • [34] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Xing Chai
    Wenhua Li
    Yuejuan Zhu
    Annals of Operations Research, 2021, 298 : 79 - 93
  • [35] 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
  • [36] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Chai, Xing
    Li, Wenhua
    Zhu, Yuejuan
    ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 79 - 93
  • [37] Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
    Fang, Yang
    Lu, Xiwen
    INFORMATION PROCESSING LETTERS, 2016, 116 (08) : 526 - 531
  • [38] Heuristics to minimize makespan of parallel batch processing machines
    Damodaran, Purushothaman
    Chang, Ping-Yu
    International Journal of Advanced Manufacturing Technology, 2008, 37 (9-10): : 1005 - 1013
  • [39] Heuristics to minimize makespan of parallel batch processing machines
    Damodaran, Purushothaman
    Chang, Ping-Yu
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 37 (9-10): : 1005 - 1013
  • [40] Heuristics to minimize makespan of parallel batch processing machines
    Purushothaman Damodaran
    Ping-Yu Chang
    The International Journal of Advanced Manufacturing Technology, 2008, 37 : 1005 - 1013
12345