Single machine parallel-batch scheduling with deteriorating jobs

被引:23
|
作者
Qi, Xianglai [1 ]
Zhou, Shiguo [1 ]
Yuan, Jinjiang [1 ]
机构
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China
基金
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词
Scheduling; Parallel batch; Deteriorating jobs; DEPENDENT PROCESSING TIMES; LINEAR DETERIORATION; COMPLETION-TIME; FLOW-SHOP;
D O I
10.1016/j.tcs.2008.11.009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider several single machine parallel-batch scheduling problems in which the processing time of a job is a linear function of its starting time. We give a polynomial-time algorithm for minimizing the maximum cost, an O(n(5)) time algorithm for minimizing the number of tardy jobs, and an O(n(2)) time algorithm for minimizing the total weighted completion time. Furthermore, we prove that the problem for minimizing the weighted number of tardy jobs is binary NP-hard. (C) 2009 Published by Elsevier B.V.
引用
收藏
页码:830 / 836
页数:7
相关论文
共 50 条
  • [41] Scheduling deteriorating jobs to minimize the makespan on a single machine
    Wu, Chin-Chia
    Shiau, Yau-Ren
    Lee, Ling-Huei
    Lee, Wen-Chiung
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (11-12): : 1230 - 1236
  • [42] Considerations of single-machine scheduling with deteriorating jobs
    Zhao, Chuan-Li
    Hsu, Chou-Jung
    Yang, Dar-Li
    [J]. APPLIED MATHEMATICAL MODELLING, 2011, 35 (10) : 5134 - 5142
  • [43] Unrelated parallel-machine scheduling with deteriorating jobs and rejection
    Hsu, Chou-Jung
    Chang, Chia-Wen
    [J]. INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 655 - 659
  • [44] Parallel-machine scheduling of simple linear deteriorating jobs
    Ji, Min
    Cheng, T. C. E.
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3761 - 3768
  • [45] Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs
    Lalla-Ruiz, Eduardo
    Voss, Stefan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 255 (01) : 21 - 33
  • [46] 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
  • [47] A note on unbounded parallel-batch scheduling
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2015, 115 (12) : 969 - 974
  • [48] The unbounded parallel-batch scheduling with rejection
    Zhang, L. Q.
    Lu, L. F.
    Ng, C. T.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (03) : 293 - 298
  • [49] Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
    Fang, Yang
    Lu, Xiwen
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (08) : 526 - 531
  • [50] Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
    Zhang, Han
    Lu, Lingfa
    Yuan, Jinjiang
    [J]. Journal of Combinatorial Optimization, 2025, 49 (01)