一类广义指派问题的重指派算法

Reassign Algorithm for a Class of Generalized Assignment Problem

讨论一类广义指派问题的近似算法,使用了笔者的一个关于含有对排列随机选取过程的时间表方法的单调性引理, 给出了一种对于可行解的改进型的重新指派方法。

In this paper we discuss an approximate algorithm for a class of Generalized Assignment Problem. Using the authors' monotonicity lemma for a Scheduling method, which includes a random selection procedure for the permutation, we give an improvement-type Reassign algorithm for the feasible solution.