%0 Journal Article
%T Minimizing Total Weighted Completion Time on Parallel Unbounded Batch Machines<br>极小化加权完工时间和的无界批量机器并行调度问题
%A LI Shu-Guang
%A LI Guo-Jun
%A WANG Xiu-Hong
%A <br>李曙光
%A 李国君
%A 王秀红
%J 软件学报
%D 2006
%I 
%X This paper considers the problem of scheduling n jobs on m parallel unbounded batch machines to minimize the total weighted completion time. Each job is characterized by a positive weight, a release time and a processing time. Each unbounded batch machine can process up to B (B≥n) jobs as a batch simultaneo usly. The processing time of a batch is the longest processing time among jobs in the batch. Jobs processed in the same batch have the same completion time, I.e., their common starting time plus the processing time of the batch. A polynomial time approximation scheme (PTAS) for this problem is presented.
%K polynomial time approximation scheme
%K scheduling
%K parallel unbounded batch machines
%K total weighted completion time
%K release times<br>多项式时间近似方案
%K 调度
%K 无界批量并行机
%K 加权完工时间和
%K 释放时间
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=65B7044C0E9A22B9&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=F3090AE9B60B7ED1&sid=1185856D4EA2ABFC&eid=1A12D34D3633DCF5&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=7