THE "TRANSFORM LEMMA" AND ITS APPLICATION IN BATCH SCHEDULING
分批排序的"转换引理"及其应用

The scheduling problems on uniformly related batch machines are firstly delivered in the paper. Two kinds of problems are considered: minimize the makespan and minimize the maximum lateness. The relation between batch scheduling and classical scheduling is declared, then an interesting " transform lemma " is obtained. Then some heuristics for theproblems are presented, and their performance guarantees are analyzed by the " transform lemma ". Some existing results are improved.