This paper considers a scheduling problem in a two-machine flowshop with outsourcing strategy incorporated. The jobs can be either processed in the first machine or outsourced to outside subcontractors. This paper wants to determine which jobs to be processed in-house and which jobs to be outsourced. If any job is decided to be outsourced, then an additional outsourcing cost is charged The objective of this paper is to minimize the sum of scheduling cost and outsourcing cost under a budget constraint. At first this paper characterizes some solution properties, and then it derives solution procedure including DP (Dynamic Programming) and B&B (Branch-and-Bound) algorithms and a greedy-type heuristic. Finally the performance of the algorithms are evaluated with some numerical tests.

1. 서 론
 2. 문제정의와 분석
 3. FSO 문제 해법
  3.1 동적계획법
  3.2 휴리스틱 알고리즘
 4. 분지한계 알고리즘
  4.1 분지규칙
  4.2 한계규칙(Bounding Rule)
  4.3 노드제거규칙(Fathoming Rules)
 5. 성능 평가
 6. 결 론
 Acknowledgement
 References

• 이익선(동아대학교 경영학과) | Ik Sun Lee Corresponding Author