• Title/Summary/Keyword: Intermediate Storage

Search Result 137, Processing Time 0.026 seconds

Intermediate Storage Process required before Operation Site Installation of System (Focusing on the Rolling Stock of Railway System) (시스템의 운용 현장 설치 전 요구되는 중간 보관 프로세스 연구 (철도차량 중심으로))

  • Choi, Yo Chul
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.16 no.2
    • /
    • pp.141-147
    • /
    • 2020
  • Due to the nature of the long-term project of a Railway business, Many problems have been arisen in the process of delivering products or systems verified by suppliers to the customer's operation site. Unexpectedly, it is often necessary for the verified products to store intermediately at the supplier's site for a variety of reasons, such as delays in business and delays in civil engineering, at the time of sending them to the customer's operation site. In this study, the intermediate storage process for finding and solving problems related to intermediate storage was presented focusing on the Rolling Stock of Railway System by reference to ISO/IEC/IEEE 15288:2015. A suitable intermediate storage process based on the developed product or system's characteristics will allow the verified products or systems to be placed on the customer's operation site and to meet the customer's product or system requirements.

Completion Time Algorithm in Multiproduct Batch Processes with Storage Time and Product Allocation Restriction in Intermediate Storage Tank (중간저장조의 저장시간과 저장제품의 제약을 고려한 다품종 회분공정의 조업완료시간 알고리듬)

  • 하진국;이경법;이인범;이의수
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.9
    • /
    • pp.727-735
    • /
    • 2003
  • The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.

Optimal Scheduling of Multi-product Batch Process for Common Intermediate Storage Policy; A Model for Batch Process Automation (다품종용 회분식 공정에서의 중간 저장 탱크 공유를 위한 최적 생산계획 ; 회분식 조업의 자동화 모델)

  • 정재학;이인범;양대륙;장근수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.303-308
    • /
    • 1992
  • In this study, we propose a shared storage system which is more efficient policy than MIS(Mixed Intermediate Storage) policy for relatively rare storage system and can be called CIS(Common Intermediate Storage) policy. Using this strategy, we develop a new completion time algorithm and apply it to two kinds of optimal or near optimal scheduling method; combinatorial search and simulated annealing method. We also extend this strategy to other storage policy, for example MIS policy, with PLC(Programmable Logic Controller) logic and on/off action of electronic valves. It thus can be accepted as a basic form of FMS(Flexible Manufacturing System) for operating various storage policies. Finally we suggest the interlocking block to compansate for the shortcoming of CIS policy, i.e, complication of operation and safety, resulting in a basic batch process automation mode.

  • PDF

Development of a Simulator for the Intermediate Storage Hub Selection Modeling and Visualization of Carbon Dioxide Transport Using a Pipeline (파이프라인을 이용한 이산화탄소 수송에서 중간 저장 허브 선정 모델링 및 시각화를 위한 시뮬레이터 개발)

  • Lee, Ji-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.12
    • /
    • pp.373-382
    • /
    • 2016
  • Carbon dioxide Capture and Storage/Sequestration (CCS) technology has attracted attention as an ideal method for most carbon dioxide reduction needs. When the collected carbon dioxide is transported to storage via pipelines, the direct transport is made if the storage is close, otherwise it can also be transported via an intermediate storage hub. Determining the number and the location of the intermediate storage hubs is an important problem. A decision-making algorithm using a mathematical model for solving the problem requires considerably more variables and constraints to describe the multi-objective decision, but the computational complexity of the problem increases and it also does not guarantee the optimality. This research proposes an algorithm to determine the location and the number of the intermediate storage hub and develop a simulator for the connection network of the carbon dioxide emission site. The simulator also provides the course of transportation of the carbon dioxide. As a case study, this model is applied to Korea.

Optimal scheduling for multi-product batch processes under consideration of non-zero transfer times and set-up times

  • Jung, Jae-Hak;Lee, In-Beum;Yang, Dae-Ryook;Chang, Kun-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.30-35
    • /
    • 1993
  • Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.

  • PDF

A modified simulated annealing search algorithm for scheduling of chemical batch processes with CIS policy

  • Kim, Hyung-Joon;Jung, Jae-Hak
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.319-322
    • /
    • 1995
  • As a trend toward multi-product batch processes is increasing in Chemical Process Industry (CPI), multi-product batch scheduling has been actively studied. But the optimal production scheduling problems for multi-product batch processes are known as NP-complete. Recently Ku and Karimi [5] have studied Simulated Annealing(SA) and Jung et al.[6] have developed Modified Simulated Annealing (MSA) method which was composed of two stage search algorithms for scheduling of batch processes with UIS and NIS. Jung et al.[9] also have studied the Common Intermediate Storage(CIS) policy which have accepted as a high efficient intermediate storage policy. It can be also applied to pipeless mobile intermediate storage pacilities. In spite of these above researches, there have been no contribution of scheduling of CIS policy for chemical batch processes. In this paper, we have developed another MSA for scheduling chemical batch processes with searching the suitable control parameters for CIS policy and have tested the this algorithm with randomly generated various scheduling problems. From these tests, MSA is outperformed to general SA for CIS batch process system.

  • PDF

A Study on the Efficient Operation of the Intermediate Storage for Mail Delivery (우편물 중간 보관소의 효율적 운영 방안 연구)

  • Choi, Myoungjin;Yang, Jaekyung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.133-141
    • /
    • 2013
  • The revitalization of e-business via Internet brings big changes to the postal business, and leads to a tremendous increase of heavy and large sized postal mails with continuing growth of home delivery business. Thus, even though the number of intermediate storages for mail delivery that mailmen use for picking up mails in the middle of mail delivery has been being increased, it has still many problems such as insufficient number and size of the storages as well as avoidance of mail keeping of trust agents. It is necessary that safety of mail keeping, seamless mail delivery, and individual parcel pick-up process reestablishment should be made through an improved counter plan for the problems described previously. This study presents the efficient and right operational plan for the intermediate storage for mail delivery with providing the number and size of intermediate storages per mail delivery sequence according to four different types of post offices.

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 batch-storage serial trains considering setup and inventory holding cost (준비비와 재고비를 고려한 직렬 비연속 공정과 중간 저장조의 최적설계)

  • Lee, Gyeong-Beom
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.4
    • /
    • pp.398-405
    • /
    • 1997
  • This article presents a new model which is called Periodic Square-Wave(PSW) to describe the material flow of the periodic processes involving intermediate buffer. The material flows incoming into and outgoing from the intermediate buffer are assumed to be periodic square shaped. PSW model gives the same result as that of Economic Production Quantity(EPQ) model for determining optimal lot size of single stage batch storage system. However, for batch storage serial train system, PSW model gives a different optimal solution of about 6 % reduced total cost. PSW model provides the more accurate information on inventory and production system than the classical approach by maintaining simplicity and increasing computational burden.

  • PDF

Intermediate Holographic Data Storage System by Using Sequentially Superimposed Recording

  • Yi, Jong-Su;Lee, Yeon-Ho
    • Journal of the Optical Society of Korea
    • /
    • v.13 no.4
    • /
    • pp.456-463
    • /
    • 2009
  • We introduce a holographic data storage system for intermediating between small data sets and mass holographic data recording. It employs a holographic sequentially superimposed recording technique. We discuss a time scheduling technique for making uniform reconstruction of sequentially recorded holograms and we show experimental results. We also discuss the Bragg selectivity of sequentially recorded holograms. The maximum storage density of our system is estimated to be 224kbit/$mm^2$. Our system is useful as an intermediate recording system before recording mass holographic data in a larger system.