Publications
Detailed Information
정수계획법을 이용한 프로젝트 확장순서결정에 관한 연구
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 강석호 | - |
dc.contributor.author | 김지승 | - |
dc.date.accessioned | 2009-09-03T09:22:52Z | - |
dc.date.available | 2009-09-03T09:22:52Z | - |
dc.date.issued | 1985-12 | - |
dc.identifier.citation | 한국군사운영분석학회지, 제11권 제2호, pp. 15-22 (1985) | en |
dc.identifier.uri | https://hdl.handle.net/10371/8591 | - |
dc.description.abstract | Planning for the expansion of production capacity is of vital importance in many applications
within the private and public sectors. This paper considers a sequencing expansion problem in which capacity can be added only at discrete points in time. Given the demand forecast of each period, capacity and cost of each expansion project, we are to determine the sequence of expansion necessary to provide sufficient capacity to meet the demand in all periods at minimum cost. This problem is formulated as a pure integer programming and solved by branch and bound method using Lagrangian relaxation. At first. simple sequencing expansion problem is presented, and in the latter part, extension to include precedence between projects is suggested. | en |
dc.language.iso | ko | en |
dc.publisher | 한국군사운영분석학회 | en |
dc.title | 정수계획법을 이용한 프로젝트 확장순서결정에 관한 연구 | en |
dc.type | Article | en |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.