Plant location and capacity planning for components procurement under global manufacturing environments글로벌 제조환경에서의 부품 조달을 위한 공장 입지 선정 및 생산 용량 계획

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 694
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Yeong-Dae-
dc.contributor.advisor김영대-
dc.contributor.authorLim, Seung-Kil-
dc.contributor.author임승길-
dc.date.accessioned2011-12-14T02:39:02Z-
dc.date.available2011-12-14T02:39:02Z-
dc.date.issued2000-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=157955&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/40501-
dc.description학위논문(박사) - 한국과학기술원 : 산업공학과, 2000.2, [ vii, 113 p. ]-
dc.description.abstractThis 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.languageeng-
dc.publisher한국과학기술원-
dc.subjectPlant location-
dc.subjectComponents procurement-
dc.subjectGlobal manufacturing-
dc.subjectCapacity planning-
dc.subject생산 용량 계획-
dc.subject공장 입지 선정-
dc.subject부품 조달-
dc.subject글로벌 제조-
dc.titlePlant location and capacity planning for components procurement under global manufacturing environments-
dc.title.alternative글로벌 제조환경에서의 부품 조달을 위한 공장 입지 선정 및 생산 용량 계획-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN157955/325007-
dc.description.department한국과학기술원 : 산업공학과, -
dc.identifier.uid000955319-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.localauthor김영대-
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0