열처리 공정의 생산스케줄 수립과 적용에 관한 연구 (A Study on Heat-Treatment Process Scheduling forHeavy Forged Products using MIP)

서지정보

· 발행기관 : 한국경영과학회
· 수록지 정보 : 경영과학 / 29권 / 2호 / 143 ~ 155페이지
· 저자명 : 최민철

초록

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience.
To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

영어초록

The purpose of this study is to formulate and solve the scheduling problem to heat-treatment process in forging process and apply it to industries. Heat-treatment is a common process in manufacturing heavy forged products in ship engines and wind power generators. Total complete time of the schedule depends on how to group parts and assign them into heat furnace. Efficient operation of heat-treatment process increases the productivity of whole production system while scheduling the parts into heat-treatment furnace is a combinatorial problem which is known as an NP-hard problem. So the scheduling, on manufacturing site, relies on engineers' experience.
To improve heat-treatment process schedule, this study formulated it into an MIP mathematical model which minimizes total complete time. Three methods were applied to example problems and the results were compared to each other. In case of small problems, optimal solutions were easily found. In case of big problems, feasible solutions were found and that feasible solutions were very close to lower bound of the solutions. ILOG OPL Studio 5.5 was used in this study.

참고자료

· 없음