• Title/Summary/Keyword: Periodic solutions

Search Result 317, Processing Time 0.023 seconds

Optimal Design of Batch-Storage Network with Finite Intermediate Storage (저장조 용량제약이 있는 회분식 공정-저장조 그물망 구조의 최적설계)

  • Kim, Hyung-Min;Kim, Kyoo-Nyun;Lee, Gyeong-Beom
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.10
    • /
    • pp.867-873
    • /
    • 2001
  • The purpose of this study is to find analytic solution of determining the optimal capacity (lot-size) of multiproduct acyclic multistage production and inventory system to meet the finished product demand under the constraint of finite intermediate storage. Intermediate storage is a practical way to mitigate the material flow imbalance through the line of supply and demand chain. 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 storage units is an important subject for industries. The industrial solution for this subject is to use the classical economic lot sizing method, EOQ/EPQ(Economic Order Quantity/Economic Production Quantity) model, incorporated with practical experience. But EOQ/EPQ model is not suitable for the chemical plant design with highly interlinked processes and storage units because it is developed based on single product and single stage. This study overcomes the limitation of the classical lot sizing method. The superstructure of the plant consists of the network of serially and/or parallelly interlinked non-continuous processes and storage units. The processes transform a set of feedstock materials into another set of products with constant conversion factors. A novel production and inventory analysis method, PSW(Periodic Square Wave) model, is applied to describe the detail material flows among equipments. The objective function of this study is minimizing the total cost composed of setup and inventory holding cost. The advantage of PSW model comes from the fact that the model provides a set of simple analytic solutions in spite of realistic description of the material flows between processes and storage units. the resulting simple analytic solution can greatly enhance the proper and quick investment decision for the preliminary plant design problem confronted with economic situation.

  • PDF

Optimal Design of Nonsequential Batch-Storage Network (비순차 회분식 공정-저장조 망구조 최적 설계)

  • 이경범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.5
    • /
    • pp.407-412
    • /
    • 2003
  • An effective methodology is .reported for determining the optimal capacity (lot-size) of batch processing and storage networks which include material recycle or reprocessing streams. We assume that any given storage unit can store one material type which can be purchased from suppliers, be internally produced, internally consumed and/or sold to customers. We further assume that a storage unit is connected to all processing stages that use or produce the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. The objective for optimization is to minimize the total cost composed of raw material procurement, setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory hold-up. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two subproblems. The first yields analytical solutions for determining batch sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks. For the special case in which the number of storage is equal to the number of process stages and raw materials storage units, a complete analytical solution for average flow rates can be derived. The analytical solution for the multistage, strictly sequential batch-storage network case can also be obtained via this approach. The principal contribution of this study is thus the generalization and the extension to non-sequential networks with recycle streams. An illustrative example is presented to demonstrate the results obtainable using this approach.

OPTIMAL DESIGN OF BATCH-STORAGE NETWORK APPLICABLE TO SUPPLY CHAIN

  • Yi, Gyeong-beom;Lee, Euy-Soo;Lee, In-Beom
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1859-1864
    • /
    • 2004
  • An effective methodology is reported for the optimal design of multisite batch production/transportation and storage networks under uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, internally consumed, transported to or from other plant sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between plant sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of large-scale supply chain system.

  • PDF

A Period Assignment Algorithm for Real-Time System Design (실시간 시스템 설계를 위한 주기 할당 알고리즘)

  • Ryu, Min-Soo;Hong, Seong-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.61-67
    • /
    • 2000
  • Digital controllers found in many industrial real-time systems consist of a number of interacting periodic tasks. To sustain the required control quality, these tasks possess the maximum activation periods as performance constraints. An essential step in developing a real-time system is thus to assign each of these tasks a constant period such that the maximum activation requirements are met while the system utilization is minimized [1]. Given a task graph design allowing producer/consumer relationships among tasks [2], resource demands of tasks, and range constraints on periods, the period assignment problem falls into a class of nonlinear optimization problems. This paper proposes a ploynomial time approximation algorithm which produces a solution whose utilization does not exceed twice the optimal utilization. Our experimental analysis shows that the proposed algorithm finds solutions which are very close to the optimal ones in most cases of practical interest.

  • PDF

Secure Data Transmission Scheme between Network for Building Facilities Control System (빌딩시설 제어시스템용 안전한 망간 자료전송 방안)

  • Jo, In-June
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.8
    • /
    • pp.102-108
    • /
    • 2018
  • The existing data transmission technology applied between the non-secure external internet and the secure internal business network has various problems when applied to the building facility management SCADA system control network. Traditional inter-network data transfer technologies involve high complexity and high costs because blacklist-based security techniques are applied to all data. However, whitelist-based security techniques can be applied to data distributed in Building Facility Management SCADA control systems because a small number of structured control data are repeatable and periodic. This simplifies the security technology applied to inter-network data transmission, enabling building facility management SCADA system control network deployment at low cost. In this paper, we proposed building control networks specialized in building facility management SCADA control systems by providing solutions to address and address these problems.

An Analysis of the Acoustical Source Characteristics in the Time-varying Fluid Machines (유체기계 덕트 내 시변 음원의 음향 특성에 관한 연구)

  • 장승호;이준신;이정권
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.2
    • /
    • pp.104-112
    • /
    • 2003
  • The in-duct acoustical sources of fluid machines are often characterized by the source impedance and strength using the linear time-invariant model. However, negative resistances, which are physically unreasonable, have been found throughout various measurements of the source properties in IC-engines and compressors. In this paper, the effects of the time-varying nature of fluid machines on the source characteristics are studied analytically. For this purpose, the simple fluid machine consisting of a reciprocating piston and an exhaust is considered as representing a typical periodic, time-varying system and the equivalent circuits are analyzed. Simulated measurements using the analytic solutions show that the time-varying nature in the actual sources is one of the main causes of the negative source resistances. It is also found that, for the small magnitude of the time-varying component, the source radiates large acoustic power if the piston operates at twice the natural frequency of the static system. or integral submultiples of that rate.

Optimal Design Of Multisite Batch-Storage Network under Scenario Based Demand Uncertainty (다수의 공장을 포함하는 불확실한 수요예측하의 회분식 공정-저장조 망의 최적설계)

  • 이경범;이의수;이인범
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.6
    • /
    • pp.537-544
    • /
    • 2004
  • An effective methodology is reported for determining the optimal lot size of batch processing and storage networks which include uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, infernally consumed, transported to or from other sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sires while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of the global supply chain.

The Coexistence Solution using Transmission Schedule and User's Position Information in Cognitive Radio Networks (전송 스케줄 및 사용자 위치 정보를 이용한 무선 인지 네트워크의 동일 주파수 대역 공존 방안)

  • Lee, Kyu-Ho;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.189-203
    • /
    • 2012
  • In cognitive radio networks, a secondary user opportunistically accesses an empty channel based on periodic sensing results for avoiding possible interference to the primary users. However, local sensing does not guarantee the full protection of the primary users because hidden primary receivers may exist within the interference range of the secondary transmitter. To protect primary systems and simultaneously to maximize utilization of the secondary users, we need to derive carefully designed coexistence solutions for various network scenarios. In this paper, we propose coexistence conditions without any harmful interference in accordance with the uplink/downlink schedule and user position. We have classified the coexistence conditions into four different scenario cases depending on the provided information to the secondary network basestations. Computer simulation results demonstrated that the proposed method can be applied to the real cognitive radio system to improve the communication probability of CR devices.

Intermediate-Term Clinical Outcomes after Total Ankle Arthroplasty for End-Stage Rheumatoid Arthritis with Modification of Perioperative Anti-Rheumatic Medication (말기 류마티스성 발목관절염에 대한 인공관절 전치환술 및 항류마티스 약물 조절 후의 중기 추시 임상 결과)

  • Cho, Byung-Ki;Ko, Ban-Suk
    • Journal of Korean Foot and Ankle Society
    • /
    • v.23 no.3
    • /
    • pp.91-99
    • /
    • 2019
  • Purpose: This retrospective study reports the intermediate-term clinical outcomes including the practical function in daily and sports activities after total ankle arthroplasty for end-stage rheumatoid arthritis, as well as the effects of modification of perioperative anti-rheumatic medications. Materials and Methods: Twelve patients were followed for a minimum of 2 years after total ankle replacement for end-stage rheumatoid arthritis. Perioperative anti-rheumatic medications in all patients were modified based on a specific guideline. Clinical evaluations consisted of American Orthopaedic Foot and Ankle Society (AOFAS) scores, Foot and Ankle Outcome Score (FAOS), and Foot and Ankle Ability Measure (FAAM) scores. Periodic radiographic evaluation was conducted to detect changes in ankle alignment and postoperative complications. Results: Mean AOFAS, FAOS, and FAAM scores improved significantly from 37.5 to 81.2, 39.1 to 72.4, and 33.8 to 64.0 points at final follow-up, respectively (p<0.001). Functional outcomes in daily and sports activities at final follow-up were found to be 76.5 and 55.8 points for the FAOS and 70.5 and 57.5 points for the FAAM, respectively. As early postoperative complications, there was one case of local wound necrosis, one case of medial malleolar fracture, and one case of deep peroneal nerve injury. Radiological evaluation revealed two cases of asymptomatic heterotopic ossification and one case of progressive arthritis in the talonavicular joint. Reoperation was performed in only one patient (8.3%) with a medial soft tissue impingement at a mean of 35.6 months follow-up. Conclusion: Total ankle arthroplasty appears to be an effective surgical option for end-stage rheumatoid arthritis. Practical functions in daily and sports activities were significantly improved at intermediate-term follow-up. Modification of perioperative anti-rheumatic medications can be one of the solutions to reduce the postoperative complication rate.

Dynamic Algorithm for Solid Problems using MLS Difference Method (MLS 차분법을 이용한 고체역학 문제의 동적해석)

  • Yoon, Young-Cheol;Kim, Kyeong-Hwan;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.2
    • /
    • pp.139-148
    • /
    • 2012
  • The MLS(Moving Least Squares) Difference Method is a numerical scheme that combines the MLS method of Meshfree method and Taylor expansion involving not numerical quadrature or mesh structure but only nodes. This paper presents an dynamic algorithm of MLS difference method for solving transient solid mechanics problems. The developed algorithm performs time integration by using Newmark method and directly discretizes strong forms. It is very convenient to increase the order of Taylor polynomial because derivative approximations are obtained by the Taylor series expanded by MLS method without real differentiation. The accuracy and efficiency of the dynamic algorithm are verified through numerical experiments. Numerical results converge very well to the closed-form solutions and show less oscillation and periodic error than FEM(Finite Element Method).