id: 05671136
dt: j
an: 05671136
au: Feng, Miluo
ti: Optimal batching structures of single machine scheduling.
so: Chin. Q. J. Math. 24, No. 1, 132-137 (2009).
py: 2009
pu: The Editorial Board of Chinese Quarterly Journal of Mathematics,Henan
    University, Kaifeng, Henan
la: EN
cc: 
ut: scheduling; batching; batch number; total complete time
ci: 
li: 
ab: Summary: 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.
rv: