摘要
成组技术（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.
出处
《应用数学与计算数学学报》
1995年第1期6-9,共4页
Communication on Applied Mathematics and Computation
基金
上海自然科学基金资助项目(项目编号:93ZA14004)
