Abstract: We study the problem of minimizing total weighted completion time on single batch processing machine.It is a problem of batch scheduling which arises in the burn in stage of semiconductor manufacturing.Burn in ovens are modeled as batch processing machines which can handle up to B jobs simultaneously.The processing time of a batch is equal to the longest processing time among the jobs in the batch.In 1998,Skutella formulated the parallel machine scheduling problem P||∑ω_jC_j and R||∑ω_jC_j as 0 1 mixed integer programming.Luo and Zhang formuated the single machine scheduling problem 1||∑ω_jC_j as mathematical programming.We first formulate the problem of minimizing total weighted completion time on single batch processing machine 1|B|∑ω_jC_j and get some conclusions.

Key words: scheduling, batch scheduling, mathematical programming, total competion time