Abstract: A new problem of continuous batch scheduling arisen from the heating-process of blooms in the iron and steel industry is addressed, which differs from the traditional batching machine scheduling where jobs in the same batch have a starting time and a finishing time. Each heating furnace is modeled as a continuous batch processing machine, which can handle up to C jobs simultaneously, where jobs in the same batch enter and leave the machine continuously. The processing time of a batch B_i in this paper is related to |B_i|, p_j and C, where |B_i| is the size of B_i and p_j is the processing time of job T_j in the batch. We give the expression of the processing time of batch B_i as p^{(i)}=\dmax_{T_j\in B_i}\{p_j\}(1+\displaystyle\frac{|B_i|-1}{C}). We also present a dynamic programming algorithm with complexity of O(n^2) and the properties of the optimal solution to minimize makespan.