DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Sung, Chang-Sup | - |
dc.contributor.advisor | 성창섭 | - |
dc.contributor.author | Kim, Tae-Hyung | - |
dc.contributor.author | 김태형 | - |
dc.date.accessioned | 2011-12-14T04:17:52Z | - |
dc.date.available | 2011-12-14T04:17:52Z | - |
dc.date.issued | 1993 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=68800&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41388 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1993.2, [ [ii], 30, [2] p. ] | - |
dc.description.abstract | This thesis considers a scheduling problem in the assembly-like flow system(ALFS) where each product is made through the sequential process of subassembly and assembly operations. The problem is investigated in two different models of minimizing the total weighted flow time, one in a simple ALFS consisting of two parallel machines and the other one in a generalized ALFS consisting of multiple parallel machines. Both the models are proved to be NP-complete, so that some dominance solution properties are respectively characterized to derive greedy-type heuristic solution procedures. The heuristic procedures are then tested for their efficiencies with various numerical examples. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Production scheduling of products with subassemblies | - |
dc.title.alternative | 부분조립품을 가지는 제품의 생산일정계획 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 68800/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000911175 | - |
dc.contributor.localauthor | Sung, Chang-Sup | - |
dc.contributor.localauthor | 성창섭 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.