Abstract
This paper presents an approximation method for obtaining a feasible solution of an assignment problem in which several constraints exist for each period and all assignments are adjusted according to a priority order. The proposed method is applicable to assignment problems whose cost coefficients cannot clearly be determined. In the method, the following three procedures are iteratively carried out to decrease the sum of infeasibilities ; (i)a set of integer variables to be changed is chosn by means of search trees, (ii)the trees are modified after the integer variables are changed, and (iii)the assignments are altered so that the number of deleted arcs is as small as possible.
