원문정보
Heuristic algorithm to assign job in inspection process
초록
영어
In this paper, we developed a heuristic algorithm to assign job to workers in parallel line inspection process without sequence. Objective of assigning job in inspection process is only to assign job to workers evenly. But this objective needs much time and effort since there are many cases in assigning job and cases increase geometrically if the number of job and worker increases. In order to solve this problem, we proposed heuristic algorithm to assign job to workers evenly. Experiments of assigning job are performed to evaluate performance of this heuristic algorithm. The result shows that heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are more than two optimal solutions, this heuristic algorithm can find the optimal solution with 98% accuracy.
목차
1. 서론
2. 문제의 정의 및 휴리스틱 알고리즘
2.1 문제의 정의
2.2 휴리스틱 알고리즘
3. 적용결과 및 분석
3.1 최적배분의 해가 한 개인 경우
3.2 최적배분의 해가 여러 개인 경우
3.3 최적배분의 해가 없는 경우
3.4 작업시간 분산과 평활지수 간의 관계
4. 결론
5. 참고문헌
