Given the plant layout, the number of workers, the maximum number of machines that a worker can handle, and the preferences between each worker and each machine, the problem to minimize the deviations of workloads assigned to workers and to maximize the total preference between each worker and each machine is considered. The number of workers are fixed (no part time workers) because of the high expense of technology education and the increase of current employees. Since the workforce assignment problem in this paper is in NP-class, a heuristic algorithm is presented in multiple-row plant layout during according to two types (slow and peak) of periods. The proposed algorithm is developed based on the combination of a mixed model scheduling, simulated annealing technique and graph theory. The solution generated satisfies the zone constraint (machines assigned to a worker are adjacently located). Computational results show that the presented algorithms can find a good solution quickly.

Abstract
 1. 서 론
 2. 연구문제 및 방법
  2.1 연구문제
  2.2. 연구방법
 3. 결 론
 참고문헌

• 김채복(경북대학교 경영학부)