title: Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
creator: Kanesan , Muthusamy
creator: Ishii, Hiroaki
creator: Mohri, Shintaro
creator: Teruo, Masuda
subject: TS Manufactures
description: 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)
publisher: International Society of Mathematical Sciences
date: 2001
type: Article
type: PeerReviewed
relation: http://www.jams.or.jp/notice/scmjol/
identifier:   Kanesan , Muthusamy and Ishii, Hiroaki and Mohri, Shintaro and Teruo, Masuda  (2001) Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations.  Scientiae Mathematicae Japonicae, 55 (2).  pp. 369-381.  ISSN 1346-0447     
relation: https://library.oum.edu.my/repository/624/