A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling

Abstract

We study the unbounded batch machine scheduling of n jobs to minimize the total completion time.A batch machine can handle up to B ≥ n jobs simultaneously.Eac h job is characterized by a release(arrival) time and a processing time.J obs processed in the same batch have the same completion time.(i.e., their common starting time plus the processing time of the longest job in the batch.) For batch processing, nonpreemptive scheduling is usually required and we focus on this case.I n this paper, we establish a polynomial time approximation scheme for it. © 2001 Springer Berlin Heidelberg.