Chinese Quarterly Journal of Mathematics ›› 2009, Vol. 24 ›› Issue (1): 132-137.

Previous Articles     Next Articles

Optimal Batching Structures of Single Machine Scheduling 

  

  1. Department of Mathematics, Zhengzhou University
  • Received:2009-01-10 Online:2009-03-30 Published:2023-09-11
  • About author: FENG Mi-luo(1963- ), female, native of Xiangcheng, Henan, a lecturer of Zhengzhou University, engages in operations research.
  • Supported by:
     Supported by the NSF of Henan Province(082300410070);

Abstract: 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.

Key words: scheduling, batching, batch number, total complete time

CLC Number: