@article{library_repository624,
          volume = {55},
          number = {2},
          author = {Muthusamy Kanesan  and Hiroaki Ishii and Shintaro Mohri and Masuda Teruo},
           title = {Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations},
       publisher = {International Society of Mathematical Sciences},
         journal = {Scientiae Mathematicae Japonicae},
           pages = {369--381},
            year = {2001},
        keywords = {Scheduling, single machine, polynomial algorithm, sum of completion times},
             url = {https://library.oum.edu.my/repository/624/},
        abstract = {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)}
}