원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법모형 및 근사해 발견 기법 : An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix
An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix
- 주제(키워드) Product-mix Problem , Scheduling , Integer Programming , Heuristic
- 발행기관 한국경영과학회
- 발행년도 2007
- 총서유형 Journal
- UCI G704-000239.2007.24.1.004
- KCI ID ART001072173
- 본문언어 한국어
초록/요약
Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems.
more