%0 Journal Article
%@ 1346-0447
%A Kanesan , Muthusamy
%A Ishii, Hiroaki
%A Mohri, Shintaro
%A Teruo, Masuda
%A Open University Malaysia,
%D 2001
%F library_repository:624
%I International Society of Mathematical Sciences
%J Scientiae Mathematicae Japonicae
%K Scheduling, single machine, polynomial algorithm, sum of completion times
%N 2
%P 369-381
%T Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
%U https://library.oum.edu.my/repository/624/
%V 55
%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)