处理机具有准备时间的变速机排序问题Rm,a_i｜｜∑C_j

The unrelated processors scheduling problem Rm,a i||∑C * j

讨论任务加工不可中断，处理机为变速机的排序问题Ｒｍ，ａｉ｜｜∑Ｃｊ．通过改变加工时间矩阵。

In this paper we discuss the nonpreemptive unrelated processors scheduling problem R m,a i||∑C j. The problem is transformed into classical scheduling problem with change of processing matrix.