creators_name: Kanesan , Muthusamy
creators_name: Ishii, Hiroaki
creators_name: Mohri, Shintaro
creators_name: Teruo, Masuda
type: article
datestamp: 2011-11-03 06:27:42
lastmod: 2011-11-03 06:27:42
metadata_visibility: show
corp_creators: Open University Malaysia
title: Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
ispublished: pub
subjects: TS
full_text_status: none
pres_type: paper
keywords: Scheduling, single machine, polynomial algorithm, sum of completion times
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)
date: 2001
date_type: published
publication: Scientiae Mathematicae Japonicae
volume: 55
number: 2
publisher: International Society of Mathematical Sciences
pagerange: 369-381
refereed: TRUE
issn: 1346-0447
official_url: http://www.jams.or.jp/notice/scmjol/
citation:   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