%0 Journal Article
%T THE "TRANSFORM LEMMA" AND ITS APPLICATION IN BATCH SCHEDULING<br>分批排序的"转换引理"及其应用
%A Yu Zhong ZHANG
%A Zhong Zhi WANG
%A Chang Yu WANG
%A <br>张玉忠
%A 王忠志
%A 王长钰
%J 系统科学与数学
%D 2002
%I 
%X 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.
%K Scheduling
%K uniform machines
%K LPT algorithm
%K LS algorithm
%K Bin-packing<br>排序
%K 同类机
%K LPT算法
%K LS算法
%K 装箱
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=E924FAF1F08F5234&yid=C3ACC247184A22C1&vid=BC12EA701C895178&iid=38B194292C032A66&sid=A5B34D9E8FDA439A&eid=CF6CB42CFF3D4C4E&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=9&reference_num=19