DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Hwang, Hark | - |
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 황학 | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | Moon, Dug-Hee | - |
dc.contributor.author | 문덕희 | - |
dc.date.accessioned | 2011-12-14T04:15:06Z | - |
dc.date.available | 2011-12-14T04:15:06Z | - |
dc.date.issued | 1986 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=65273&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41200 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1986.2, [ [ii], 42 p. ] | - |
dc.description.abstract | This study is concerned with a single-facility production problem where the facility can be employed for two distinct processes; process 1 and 2. By process 1, two distinct products, say product 1 and 2, are produced simultaneously while product 2 can also be produced by process 2. For the model developed, each process is scheduled repeatedly in a sequence of production cycles over an infinite time horizon, but not always in equal lot size. The demands for the two products are known in their associated constant rates. The objective is to determine the repeating sequences of the two processes and their associated lot sizes which minimize the total cost consisting of set-up and inventory holding. A solution algorithm is developed and it is illustrated with a numerical example. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | (A) single-facility two-product inventory system with by-product | - |
dc.title.alternative | 단일설비하의 부산품이 발생되는 두 제품 생산체계에 관한 재고모형 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 65273/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000841098 | - |
dc.contributor.localauthor | Hwang, Hark | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 황학 | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.