Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time  

作　　者：Cuixia Miao Yunjie Xia Yuzhong Zhang Juan Zou 

机构地区：[1]School of Mathematical Sciences,Qufu Normal University,Qufu,Shandong,273165,P.R.China [2]School of Physics and Engineering,Qufu Normal University,Qufu,Shandong,273165,P.R.China [3]School of Office,Qufu Normal University,Qufu,Shandong,273165,P.R.China [4]School of Management Sciences,Qufu Normal University,Rizhao,Shandong,276826,P.R.China

出　　处：《Journal of the Operations Research Society of China》2013年第3期377-383,共7页中国运筹学会会刊（英文）

基　　金：This work was supported by the National Natural Science Foundation of China(Nos.11201259,11071142,71101081);the Doctoral Fund of the Ministry of Education(Nos.20123705120001,20123705120003);the Natural Science Foundation of Shandong Province(Nos.ZR2011AL017,ZR2010AM034);Doctoral Research Fund(No.20110130)and Postdoctoral Researcher of Qufu Normal University;We thank the editor an。

摘　　要：We consider bounded parallel-batch scheduling with proportional-linear deteriorating jobs and the objective to minimize the total completion time.We give some properties of optimal schedules for the problem and present for it a dynamic programming algorithm running in O(b^(2)m^(2)2^(m))time,where b is the size of a batch and m is the number of distinct deterioration rates.

关 键 词：Batch scheduling Deteriorating jobs Dynamic programming algorithm 

分 类 号：O17[理学—数学]