DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Yeong-Dae | - |
dc.contributor.advisor | 김영대 | - |
dc.contributor.author | Lim, Seung-Kil | - |
dc.contributor.author | 임승길 | - |
dc.date.accessioned | 2011-12-14T02:39:02Z | - |
dc.date.available | 2011-12-14T02:39:02Z | - |
dc.date.issued | 2000 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=157955&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/40501 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 산업공학과, 2000.2, [ vii, 113 p. ] | - |
dc.description.abstract | This dissertation focuses on plant location and capacity planning for components procurement under global manufacturing environments. For the economical procurement and/or supply for components needed by globally dispersed plants (customers), the schedule of opening components manufacturing plants, plans for acquisition of capacities in opened components manufacturing plants, and plans for components procurement are determined. Several practical considerations in plant location and capacity planning for components manufacturing and procurement are considered such as: types, sizes and functional characteristics of facilities; limitations on investments for opening plants and purchasing facilities; a special requirement for components procurement in global manufacturing environments. First, a problem of multiperiod capacity planning for components manufacturing plants is solved to determine a mix of flexible and dedicated capacities under budget restriction. Schedules of acquiring and replacing facilities are determined and operations are assigned to the flexible and dedicated facilities. The problem is formulated as a mixed integer linear program and solved by the Lagrangian relaxation approach. A subgradient optimization method and a multiplier adjustment method are employed to obtain better lower bounds. An LP-based Lagrangian heuristic algorithm is developed to find good feasible solutions. Second, a dynamic plant location and capacity planning problem is solved for distributed components manufacturing and procurement/supply. The opening schedule of components manufacturing plants, allocations of customers```` demands and plans for acquisition and/or disposal of plants capacities are determined. The problem is formulated as a mixed integer linear program and solved by a heuristic algorithm based on Lagrangian relaxation and a cut and branch algorithm which uses Gomory cuts. Several solution properties of the relaxed problem are found and used to develop effic... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Plant location | - |
dc.subject | Components procurement | - |
dc.subject | Global manufacturing | - |
dc.subject | Capacity planning | - |
dc.subject | 생산 용량 계획 | - |
dc.subject | 공장 입지 선정 | - |
dc.subject | 부품 조달 | - |
dc.subject | 글로벌 제조 | - |
dc.title | Plant location and capacity planning for components procurement under global manufacturing environments | - |
dc.title.alternative | 글로벌 제조환경에서의 부품 조달을 위한 공장 입지 선정 및 생산 용량 계획 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 157955/325007 | - |
dc.description.department | 한국과학기술원 : 산업공학과, | - |
dc.identifier.uid | 000955319 | - |
dc.contributor.localauthor | Kim, Yeong-Dae | - |
dc.contributor.localauthor | 김영대 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.