数学季刊（英文版）
數學季刊（英文版）
수학계간（영문판）
CHINESE QUARTERLY JOURNAL OF MATHEMATICS
2009年
1期
132-137
,共6页
scheduling%batching%batch number%total complete time
A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal batching structures of the problems on the batching ways: all jobs in exactly N(arbitrary fix batch number and 1 < N < n) batches.
