【摘要】 讨论了一类工件的加工时间具有学习效应且安装时间带有恶化的成组排序问题,目标函数分别为极小化最大完工时间和极小化总完工时间,1|pij=aij-bijt,S=δit,GT|Cmax,1|pij=aij-bijt,S=δit,GT|∑Cij,并分别给出了求最优解的多项式时间算法,其中极小化总完工时间问题是在bij=b,δi=δ的特殊情况下给出的。更多还原

【Abstract】 In this paper,we discuss a group scheduling problem with learning effect of processing times and deterioration of setup times,the objectives are to minimize the make-span and total complete time respectively.1|pij=aij-bijt,S=δit,GT|Cmax,1|pij=aij-bijt,S=δit,GT|∑Cij Two polynomial-time algorithms are obtained,in which the algorithm of the total complete time problem is proposed in a special case(bij=b,δi=δ).更多还原