원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법모형 및 근사해 발견 기법
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 한정희 | - |
dc.contributor.author | 이영호 | - |
dc.contributor.author | 김성인 | - |
dc.contributor.author | 심보경 | - |
dc.date.accessioned | 2021-09-09T17:44:33Z | - |
dc.date.available | 2021-09-09T17:44:33Z | - |
dc.date.created | 2021-06-17 | - |
dc.date.issued | 2007 | - |
dc.identifier.issn | 1225-1100 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/125891 | - |
dc.description.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. | - |
dc.language | Korean | - |
dc.language.iso | ko | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법모형 및 근사해 발견 기법 | - |
dc.title.alternative | An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김성인 | - |
dc.identifier.bibliographicCitation | 경영과학, v.24, no.1, pp.35 - 43 | - |
dc.relation.isPartOf | 경영과학 | - |
dc.citation.title | 경영과학 | - |
dc.citation.volume | 24 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 35 | - |
dc.citation.endPage | 43 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001072173 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Product-mix Problem | - |
dc.subject.keywordAuthor | Scheduling | - |
dc.subject.keywordAuthor | Integer Programming | - |
dc.subject.keywordAuthor | Heuristic | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.