부품외주를 고려한 조립형 Flowshop 일정계획문제 연구

• 영문명: An Assembly-Type Flowshop Scheduling Problem with Outsourcing Allowed
• 발행기관: 한국산업경영시스템학회
• 저자명: 전재호(Jae-Ho Juhn)
• 간행물 정보: 『산업경영시스템학회지』제29권 제4호, 34~42쪽, 전체 9쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2006.12.01

영문 초록

  This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage. The two types of the components should be prepared at the first stage before starting the assembly operation for each job at the second stage. The objective is to schedule the jobs so that the makespan is minimized. Some solution properties and lower bounds are derived and incorporated into a branch and bound algorithm. Also, an efficient heuristic is developed. The performances of the proposed branch and bound algorithm and heuristic are evaluated through computational experiments.

목차

1. 서론
2. 문제정의와 분석
3. 하한값(Lower bounds)
4. 분지한계 알고리즘
5. 계산실험 및 성능평가
6. 결론
참고문헌

키워드

Assembly-Type Flowshop Scheduling Heuristic Branch-and-Bound