%A Muthusamy Kanesan 
%A Hiroaki Ishii
%A Shintaro Mohri
%A Masuda Teruo
%J Scientiae Mathematicae Japonicae
%T Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
%X We consider single machine batch scheduling problem for identical jobs. Constant processing times and batch setup times are assumed together with batch size and number of batch constraints. We present a polynomially bounded algorithm that minimizes the sum of completion times. (Abstract by authors)
%N 2
%K Scheduling, single machine, polynomial algorithm, sum of completion times
%P 369-381
%V 55
%D 2001
%I International Society of Mathematical Sciences
%L library_repository624