This research is to sequence flow shop with two parallel parts production and two assembly machines in sequence. Two different objective functions are studied. One is to minimize total completion time and the other is to minimize the difference of 1 job completion time and total completion time. A heuristic is designed to solve the sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. Experimental 5 job problems are used to evaluate the performance of the suggested heuristic. The optimum solutions obtained by enumeration are used to comparisons. Also 20 job problems are generated for evaluations. 100 randomly generated sequences are evaluated and proved that the distributions are normal. And then presented how good the solutions obtained by suggested method. The initial solution stage is different for the minimization of completion time differences.

Abstract
 1. 서론
 2. 2단계조립 이정계획 문제 
 3. 해법의 설계
 4. 수치실험 및 결과 분석 
 5. 결론
 참고문헌

• 이재욱(동아대학교)
• 문기주(동아대학교)