This paper considers a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advance. The manufactured components are subsequently assembled into products. The completion time of a job(product) is measured by the latest completion time of its all components at the pre-assembly stage. To minimize the total weighted completion time of a finite number of jobs, a branch-and-bound scheme is developed.. Also, three constructive heuristic algorithms are developed based on the machine aggregation and greedy strategies. Some empirical evaluation of the performance of the proposed branch-and-bound algorithm are also performed.

Abstract
 1. 서 론
 2. 문제정의 및 분석
 3. 분지한계법(branch-and-bound)
 4. 수치실험
 참고문헌

• 윤상흠(전주대학교 정보기술컴퓨터공학부)
• 권용석(전주대학교 공학부)