원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법모형 및 근사해 발견 기법An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix
- Other Titles
- An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix
- Authors
- 한정희; 이영호; 김성인; 심보경
- Issue Date
- 2007
- Publisher
- 한국경영과학회
- Keywords
- Product-mix Problem; Scheduling; Integer Programming; Heuristic
- Citation
- 경영과학, v.24, no.1, pp.35 - 43
- Indexed
- KCI
- Journal Title
- 경영과학
- Volume
- 24
- Number
- 1
- Start Page
- 35
- End Page
- 43
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/125891
- ISSN
- 1225-1100
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholar.korea.ac.kr/handle/2021.sw.korea/125891)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.