We consider a single machine batching problem 
for identical jobs. 
Constant processing times and batch setup times 
are assumed together with number of batches and 
batch size limitations. We present a polynomially 
bounded algorithm that produces good near optimal 
solutions with respect to minimizing the sum of 
completion times.