Title :
A PTAS for Minimizing Total Completion Time of Batch Scheduling under Tree Precedence Constraints
Author :
Ran, Ma ; Xuefeng, Han
Author_Institution :
Coll. of Math. & Inf. Sci., Henan Polytech. Univ., Jiaozuo, China
Abstract :
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.
Keywords :
approximation theory; batch processing (industrial); computational complexity; scheduling; batch scheduling; polynomial-time approximation scheme; total completion time minimization; tree precedence constraints; Educational institutions; Information science; Mathematics; Optimal scheduling; Polynomials; Radio access networks; Scheduling algorithm; approximation scheme; precedence constraints; scheduling;
Conference_Titel :
Information Engineering, 2009. ICIE '09. WASE International Conference on
Conference_Location :
Taiyuan, Chanxi
Print_ISBN :
978-0-7695-3679-8
DOI :
10.1109/ICIE.2009.177
