• 제목/요약/키워드: optimal capacity

검색결과 1,695건 처리시간 0.033초

회분식 공정-저장조 그물망 구조의 최적설계 (Optimal Design of Batch-Storage Network)

  • 이경범;이의수
    • 제어로봇시스템학회논문지
    • /
    • 제4권6호
    • /
    • pp.802-810
    • /
    • 1998
  • The purpose of this study is to find the analytic solution of determining the optimal capacity of processes and storages to meet the product demand. Recent trend to reduce product delivery time and to provide high quality product to customer requires the increasing capacity of storage facilities. However, the cost of constructing and operating storage facilities is becoming substantial because of increasing land value, environmental and safety concern. Therefore, reasonable decision making about the capacity of processes and storages is important subject for industries. The industrial solution for this subject is to use the classical economic lot sizing method, EOQ(Economic Order Quantity) model, trimmed with practical experience but the unrealistic assumption of EOQ model is not suitable for the chemical plant design with highly interlinked processes and storages. This study, a first systematic attempt for this subject, clearly overcomes the limitation of classical lot sizing method. The superstructure of the plant consists of the network of serially and/or parallelly interlinked processes and storages. A novel production and inventory analysis method, PSW(Periodic Square Wave) model, is applied. The objective function of optimization is minimizing the total cost composed of setup and inventory holding cost. The advantage of PSW model comes from the fact that the model provide a set of simple analytic solution in spite of realistic description of material flow between process and storage. The resulting simple analytic solution can greatly enhance the proper and quick investment decision for the preliminary plant design confronting diverse economic situation.

  • PDF

농용 무인헬리콥터의 원심클러치 설계 - 최적 설계치의 시뮬레이션 - (Centrifugal Clutch Design for Unmanned Helicopter - Simulation of Optimal Factors -)

  • 이재홍;구영모
    • Journal of Biosystems Engineering
    • /
    • 제34권2호
    • /
    • pp.89-94
    • /
    • 2009
  • Aerial application using an agricultural unmanned helicopter was suggested for an alternative against current pesticide application methods. Centrifugal clutches play important roles in the performance and safety of the helicopter operation. A previous study analyzed and verified the power transfer theory of the guide type centrifugal clutch. Based on the clutch theory, optimal designs of the clutch became possible and feasible using a simulation method. Design criteria of the clutch were the power transfer capacity of 24.66 kW(33.5 PS) at the rated engine speed and the engaging range speed of 3,000${\sim}$3,500 rpm. Various designs were accomplished using the simulation. An optimal clutch was simulated by determining the values of spring constant and mass of friction sector, which were 94,700 N/m and 123.7 g, respectively. The design performed the power capacity of 24.86 kW(33.8 PS) and engagement speed of 3,069 rpm, meeting the design criteria. Using the designed clutch, an efficient transfer of the power would be possible for the unmanned agricultural helicopter.

A Strong LP Formulation for the Ring Loading Problem with Integer Demand Splitting

  • Lee, Kyung-Sik;Park, Sung-Soo
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
    • /
    • pp.306-310
    • /
    • 2004
  • In this paper, we consider the Ring Loading Problem with integer demand splitting (RLP). The problem is given with a ring network, in which a required traffic requirement between each selected node pair must be routed on it. Each traffic requirement can be routed in both directions on the ring network while splitting each traffic requirement in two directions only by integer is allowed. The problem is to find an optimal routing of each traffic requirement which minimizes the capacity requirement. Here, the capacity requirement is defined as the maximum of traffic loads imposed on each link on the network. We formulate the problem as an integer program. By characterizing every extreme point solution to the LP relaxation of the formulation, we show that the optimal objective value of the LP relaxation is equal to p or p+0.5, where p is a nonnegative integer. We also show that the difference between the optimal objective value of RLP and that of the LP relaxation is at most 1. Therefore, we can verify that the optimal objective value of RLP is p+1 if that of the LP relaxation is p+0.5. On the other hand, we present a strengthened LP with size polynomially bounded by the input size, which provides enough information to determine if the optimal objective value of RLP is p or p+1.

  • PDF

하모니서치 알고리즘을 이용한 반도체 공정의 최적버퍼 크기 결정 (Determination of Optimal Buffer Size for Semiconductor Production System using Harmony Search Algorithm)

  • 이병길;변민석;김여진;이종환
    • 반도체디스플레이기술학회지
    • /
    • 제19권4호
    • /
    • pp.39-45
    • /
    • 2020
  • In the production process, the buffer acts as a buffer to alleviate some of the problems such as delays in delivery and process control failures in unexpected situations. Determining the optimal buffer size can contribute to system performance, such as increased output and resource utilization. However, there are difficulties in allocating the optimal buffer due to the complexity of the process or the increase in the number of variables. Therefore, the purpose of this research is proposing an optimal buffer allocation that maximizes throughput. First step is to design the production process to carry out the research. The second step is to maximize the throughput through the harmony search algorithm and to find the buffer capacity that minimizes the lead time. To verify the efficiency, comparing the ratio of the total increase in throughput to the total increase in buffer capacity.

Cooperation Method for Cellular Communication Systems

  • Kim, Eung-Sun;Kim, Young-Doo;Park, Sang-Kyu
    • 한국통신학회논문지
    • /
    • 제32권12A호
    • /
    • pp.1251-1259
    • /
    • 2007
  • A scheme for selecting the mode with the maximum system capacity is proposed for cooperative relaying. Three possible modes are presented based on decode-and-forward relaying, and the time required by each mode is evaluated. Based on these results, a method is then developed for selecting the optimal mode with the minimum time duration (or maximum channel capacity). Computer simulations confirm that the optimal mode outperforms the other modes.

계통안정화를 위한 SMES의 적정위치와 용량설정에 관한 연구 (A Study on the Optimal Site and Capacity of SMES for Power System Stabilization)

  • 이재민;임재윤;이종필;김정훈
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 하계학술대회 논문집 D
    • /
    • pp.794-796
    • /
    • 1997
  • The superconducting magnetic energy storage (SMES) system is considered to be useful to charge or release an energy in power system because of the high efficiency and quick response. But we need much capital to construct and to operate a SMES. A site and capacity of SMES are important elements for effective operating and planning. In this paper, we proposed a performance function to determine an optimal site and capacity of SMES according to variety condition of power system such as fault point. In addition, to demonstrate the validity of a proposed method, the simulations were carried out on two-machine 5-bus system.

  • PDF

신뢰도비용을 고려한 풍력발전에 연계된 배터리의 최적 용량에 관한 연구 (A Study on Optimal Battery Capacity with Windfarm Considering Reliability Cost)

  • 김욱원;김성열;김규호;김진오
    • 전기학회논문지
    • /
    • 제60권2호
    • /
    • pp.273-278
    • /
    • 2011
  • By introducing RPS(Renewable Portfolio Standard) for reduction of greenhouse gas, Renewable energy has becoming widespread gradually. Due to a large number of advantages, wind power, which is one of Renewable energy, has standing in the spot-light rather than other Renewable energy. Wind power, however, is difficult to control output and because of severe output fluctuation, it would cause some problems when it is connected with system. Using battery as a solution for these problems has been researched all over the world. In this paper, the reliability modeling of windfarm connected battery and reliability evaluation of system are executed. Also the optimum battery capacity is selected through evaluating reliability cost.

수요를 고려한 잔고의 최적 Capacity 확장을 위한 진화 프로그램 (Evolution Program for Optimal Capacity Expansion with Backlogs in Demand)

  • 조정복;양황규;이재욱;함창현
    • 한국정보처리학회논문지
    • /
    • 제6권3호
    • /
    • pp.672-680
    • /
    • 1999
  • This paper presents an evolution program for optimal expansion problem with backlogs in demand which is to determine when and how much capacity should be added under varying types of demand and cost. To overcome premature convergence and stalling, we employ an exponential-fitness scaling scheme. To improve the chromosomes, we introduce hetero-dimensional mutation which generates a new dimension and produces a feasible solution, and homo-dimensional mutation which mutates the chromosomes in the negative of gradient direction. Finally, a numerical example is discussed.

  • PDF

반도체 Probe 공정에서의 생산 능력 계획 (Capacity Planning and Control of Probe Process in Semiconductor Manufacturing)

  • 정봉주;이영훈
    • 산업공학
    • /
    • 제10권1호
    • /
    • pp.15-22
    • /
    • 1997
  • In semiconductor manufacturing, the probe process between fabrication and assembly process is constrained mostly by the equipment capacity because most products pass through the similar procedures. The probe process is usually performed in a batch mode with relatively short cycle times. The capability of the probe process can be determined by the optimal combination of the equipments and the products. A probe line usually has several types of equipment with different capacity. In this study, the probe line is modeled in terms of capacity to give the efficient planning and control procedure. For the practical usage, the hierarchical capacity planning procedure is used. First, a monthly capacity plan is made to meet the monthly production plan of each product. Secondly, the daily capacity planning is performed by considering the monthly capacity plan and the daily fabrication output. Simple heuristic algorithms for daily capacity planning are developed and some experimental results are shown.

  • PDF

영업용 물류센터 사용하에서 자가 물류센터의 크기 확장계획 모형 (Capacity Expansion Planning Model of Private Distribution Center Under Usability of Public Distribution Center)

  • 장석화
    • 산업경영시스템학회지
    • /
    • 제33권1호
    • /
    • pp.71-79
    • /
    • 2010
  • This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.