A PTAS for Minimizing Total Completion Time of Batch Scheduling Under Tree Precedence Constraints

摘要：

We consider the bounded batch scheduling problem to minimize total completion time for jobs with release dates and identical processing time under tree precedence constraints. We give the first polynomial-time approximation scheme (PTAS) for the problem.

关键词： precedence constraints approzimation scheme scheduling

作者: Ma Ran Han Xuefeng

作者单位: College of Mathematics and Information Science Henan Polytechnic University Jiaozuo, Henan, 454000, China

会议类型: 国际会议

会议名称: 2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

会议地点: 太原

会议语种:英文

页码: 1020-1022

在线出版日期: 2009-07-10（万方平台首次上网日期，不代表论文的发表时间）