부품외주를 고려한 조립형 Flowshop 일정계획 해법 개선

• 영문명: An Improvement of Algorithms for Assembly-type Flowshop Scheduling Problem with Outsourcing
• 발행기관: 한국산업경영시스템학회
• 저자명: 윤상흠(Sang Hum Yoon) 전재호(Jaeho Juhn)
• 간행물 정보: 『산업경영시스템학회지』제31권 제2호, 80~93쪽, 전체 14쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2008.06.30

영문 초록

  This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

목차

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

키워드

Assembly-Type Flowshop Scheduling Heuristic Branch-and-Bound