成長하는 生産시스템의 設備開設과 設備增設의 最適立地選定에 관한 硏究
- Alternative Title
- An Improved Dual-Based Algorithm for the Multi-period Phase-in Model
- Abstract
- 生産시스템에서 設備立地選定問題는 매우 중요하고도 어려운 문제이다. 더구나 들어가는 需要에 대해 增設의 문제까지 고려할 때는 더욱 복잡한 문제가 된다. 본논문에서는 이 문제의 해결을 위해 雙對上昇過程, 雙對下向過程, 分段探索法, 노드簡略化등을 이용한 解法에 관하여 연구하였다.
We improved and developed a method for the multi-period facility phase-in problem in the uncapacitated case. The problem can be stated that a number of sites are available at which facilities can to estabilished to provide a set of service to given demand points. The demand in each time period must be satisfied and a fixed charge is associated with opening a facility at a site, and we add facilities over a planning horizon of T time periods, as overall demands are strictly increasing. The objective is to determine a set of facilities to open which minimizes the overall fixed cost and transportation cost over the planning horizon.
In this paper the dual ascent procedure which is based on the complementary slackness condition, and the dual descent procedure which is developed to supplement the dual ascent procedure, and the branch and bound method and Node Simplification were used for the solution process.
We improved and developed a method for the multi-period facility phase-in problem in the uncapacitated case. The problem can be stated that a number of sites are available at which facilities can to estabilished to provide a set of service to given demand points. The demand in each time period must be satisfied and a fixed charge is associated with opening a facility at a site, and we add facilities over a planning horizon of T time periods, as overall demands are strictly increasing. The objective is to determine a set of facilities to open which minimizes the overall fixed cost and transportation cost over the planning horizon.
In this paper the dual ascent procedure which is based on the complementary slackness condition, and the dual descent procedure which is developed to supplement the dual ascent procedure, and the branch and bound method and Node Simplification were used for the solution process.
- Author(s)
- 이영덕
- Issued Date
- 1984
- Type
- Research Laboratory
- URI
- https://oak.ulsan.ac.kr/handle/2021.oak/4654
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002024318
- 공개 및 라이선스
-
- 파일 목록
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.