복수의 부품 및 조립 흐름공정의 총흐름시간 최소화

• 영문명: Minimizing Total Flow Time for Multiple Parts and Assembly Flow Shop
• 발행기관: 한국산업경영시스템학회
• 저자명: 문기주(Gee Ju Moon) 이재욱(Jae Wook Lee)
• 간행물 정보: 『산업경영시스템학회지』제34권 제4호, 82~88쪽, 전체 7쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2011.12.31

영문 초록

A typical job sequencing problem is studied in this research to improve productivities in manufacturing companies. The problem consists of two-stage parts and assembly processes. Two parts are provided independently each other and then two sequential assembly processes are followed. A new heuristic is developed to solve the new type of sequencing problem. Initial solution is developed in the first stage and then the initial solution is improved in the second stage. In the first stage, a longer part manufacturing time for each job is selected between two, and then a sequence is determined by descending order of the times. This initial sequence is compared with Johnson’s sequence obtained from 2-machine assembly times. Any mismatches are tried to switch as one possible alternative and completion time is calculated to determine whether to accept the new sequence or not to replace the current sequence. Searching process stops if no more improvement can be made.

목차

1. 서론

2. 2단계조립 일정계획 문제

3. 해법의 설계

4. 수치실험 및 결과 분석

5. 결론

참고문헌

키워드

Flow Shop Heuristic Makespan Job Sequencing