Johnson法则在成组加工排序中的推广  

The Extension of Johnson's Rule in Group Technology

作　　者：项思明[1] 唐国春[2] 

机构地区：[1]安徽建筑工业学院基础部,合肥230022 [2]上海第二工业大学,上海200041

出　　处：《应用数学与计算数学学报》1995年第1期6-9,共4页Communication on Applied Mathematics and Computation

基　　金：上海自然科学基金资助项目(项目编号:93ZA14004)

摘　　要：成组技术（Group Technology）是把工件分组进行加工,以提高生产效率的一种生产组织方法,本文把两台机器同序作业（同顺序流水作业）排序问题F2│perm│C_(max)的John-son法则推广到成组加工上,提出确定组与组之间顺序的最优法则,给出了这个问题成组加工的最优排法,并分析算法的计算复杂性。Group Technology(GT) is a method of organization for factories in which organizational units known as 'groups' each completes a particular set of 'family' of parts with no backflow, or cross flow between groups, and are equipped with all the facilities they need to do so. In this paper Johmson'srule for the permutation flow shop problem F2\perm\Cmax is exteded to GT an optimal rule of sequencing groups id presented, and a polynomial algorithm for the GT sequencing problem is proposed.

关 键 词：Johnson法则 成组技术 排序 成组加工 

分 类 号：O223[理学—运筹学与控制论] TH163[理学—数学]