TY  - JOUR
ID  - library_repository624
UR  - http://www.jams.or.jp/notice/scmjol/
IS  - 2
A1  - Kanesan , Muthusamy
A1  - Ishii, Hiroaki
A1  - Mohri, Shintaro
A1  - Teruo, Masuda
Y1  - 2001///
N2  - 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)
PB  - International Society of Mathematical Sciences
JF  - Scientiae Mathematicae Japonicae
VL  - 55
KW  - Scheduling
KW  -  single machine
KW  -  polynomial algorithm
KW  -  sum of completion times
SN  - 1346-0447
TI  - Single machine batching problem to minimize the sum of completion times with number of batches and batch size limitations
SP  - 369
AV  - none
EP  - 381
ER  -