The aim of this study is to minimize the total distance travelled by the examiners of college entrance examination committee, from their homes to the designated schools, such that the examiners are assigned to each school satisfying certain criteria. A network model is used and the Out-of-Kilter algorithm is applied to solve the examiner-examinee assignment problem. The result is proved to be fairly adequate not only in this problem, but also to the similar situations encountered in, say, school-grouping of junior/senior high schools, and an administration district allocation problem, etc.