• Title/Summary/Keyword: Routing Planning

Search Result 121, Processing Time 0.035 seconds

Verification of ERP Standard Time Using TOC Technique and Improvement of MES Routing Point (TOC 기법을 적용한 ERP 표준시간 검증 및 MES 공정실적개선)

  • Kim, Sung-Min;Ahn, Jaekyoung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.22-33
    • /
    • 2018
  • Recently domestic manufacturing companies have been experiencing worsening profitability and stunted growth due to the long-term economic recession and the rapid rise of developing countries such as China and Southeast Asia. These difficulties force many companies to concentrate their core competencies on new value creation and innovation in order to gain momentum for new growth. Enterprise Resource Planning (ERP) has been considered as one of viable solutions. Among the various modules in ERP, shop floor control function in the production management module is rather limited. In order to overcome this problem, Manufacturing Execution System (MES) has been used as a subsystem which has a strong information gathering power and flexibility. Both systems interact closely with each other. In particular, ERP requires fast, accurate shop floor information at MES. This paper describes how to synchronize relevant information between ERP and MES with theory of constraints (TOC). The processing time information transmitted from the MES workplace is received at the ERP workplace. In the process, the received processing time is causing information distortion in ERP, when the information gathering standard of MES is different from the ERP information interpretation standard. The Drum-Buffer-Rope theory of TOC was applied to resolve this problem, therefore, information synchronization between both systems was made. As a precondition, the standard time of the upper ERP system was rearranged according to the capacity constraints resource. As a result, standard time restructuring has affected changes in labor costs. Standard labor costs have come close to actual ones, and information synchronization of MES transmission data has improved the reliability of standard product costs, such that it enabled various company-wide restructuring actions to be much more effective.

A Bluetooth Routing Protocol for Wireless Home Networking (무선 홈 네트워킹을 위한 블루투스 라우팅 프로토콜)

  • Kim Myung-Won;Kwak Hu-Keun;Chung Kyu-Sik
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.25-27
    • /
    • 2006
  • 블루투스는 무선 홈 네트워킹을 구성하는 하나의 기술로 자리를 잡았지만, 기존의 홈 네트워킹을 구성하는 IRDA, 무선랜, Home RF, ZigBee 등에 비하여 블루투스 사용으로 인한 큰 이득이 없어 이용되지 않는 것이 현재 블루투스가 직면한 문제이다. 비슷한 통신반경을 지원하는 IRDA와 비교하면 가격과 전력소비에서 블루투스의 이점이 떨어지고, 다중 연결을 지원하는 장점에도 불구하고 10m 내의 전송 반경으로는(저 전력 사용 시) 집안을 전부 커버할 수 없기 때문에 무선랜에 비해 홈 네트워킹에서 이용성이 떨어지는 것이 사실이다. 하지만 이런 블루투스의 AD-HOC 라우팅을(1:1 혹은 1:다) 위한 블루투스 프로토콜 스택에 라우팅 프로토콜 스택을 추가함으로써 블루투스가 장착된 정보 가전기기는 주변으로부터 라우팅 정보를 수집하게 되고 라우팅 테이블을 구성할 수 있게 된다. 그러므로 전송 범위의 이상적인 설계에서 무선랜보다 넓어지게 되므로 홈 네트워킹에서 블루투스 사용의 단점이 보안됨은 물론 집안을 하나의 WEB처럼 구성할 수 있게 된다. 이에 다른 기술에 비한 저렴한 가격, 접속의 용이성, 저 전력 소비 둥과 같은 기존의 장점에 전송 거리의 단점이 보안된 블루투스 라우팅 프로토콜 기술은 IRDA, 무선랜보다 기술적 우위를 가짐으로써 홈 네트워킹에 적용이 많아지리라 예상할 수 있다. 더 나아가 블루투스 기술이 포함되어 있는 모바일 기기가 정점 늘어남에 따라 모바일 기기와의 연동에 의한 홈 네트워킹이 실생활에 적용되리라 예측되며, 집뿐만 아니라 어디에서나 다른 모바일 기기와 연결되어 네트워크를 이루는 유비쿼터스 네트워킹이 실현 될 수 있으리라 본다.-filtered CU)과는 비슷한 결과를 보였다. 결과적으로 제안된 방법은 전통적인 켑스트럴 평균 차감법에 기반하여 효과적인 채널 정규화가 가능하다는 것을 보였다.ttention since the operation of local autonomy in Korea. This trend focuses on ′visual landscape planning′, and it is expected to grow drastically in the near future. Therefore, it is recommended that we promote the more elaborate methodology of ′visual landscape planning′, which also includes the ecological and cultural aspects of the environment. 7월 시료에는 ethane, ethyl formate, trans-2-hexenal의 순서로 그 함량이 많았으며, hydrocarbon류가 전체성분의 30.42%를 차지하였다. 8월 시료는 benzyl alcohol, ethyl formate 및 trans-2-hexenal의 순서로 많이 함유되어 있었으며, ester류가 35.60%를 차지하였다. 또한 9월 시료에도 ester류가 32.92%를 차지하였으며 ethyl acetate, benzyl alcohol, ethane 및 trans-2-hexenal의 순서로 함량이 높았다.to isolate the major component of silkworm powder, which exerts blood glucose-lowering e

  • PDF

A Study on the SCM Capability Modeling and Process Improvement in Small Venture Firms (중소·벤처기업의 SCM역량 모델링과 프로세스 개선 방안에 관한 연구)

  • Lee, Seolbin;Park, Jugyeong
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.13 no.2
    • /
    • pp.115-123
    • /
    • 2018
  • This study is empirically intended to put forward the modeling and process improvement measures for the SCM capability in small venture firms. The findings are summarized as follows. There were strategic alliance, technological development and centralization in the modeling of strategic planning for supply chain, not the least of which is strategic alliance, followed by centralization and technological development. There were routing scheduling, network integration and third party logistics outsourcing in decision making, not the least of which was network integration. There were customer service management, productivity management and quality management in management control, not the least of which was quality management. And there were order management choice, pricing demand, shipment delivery and customer management in transaction support system, not the least of which was order management choice. As for the above-mentioned findings, to maximize the SCM capability and operate the optimized process in small venture firms, the existing strategic alliances can optimize the quality management and stabilize the transaction support system through the network sharing and integration from the perspective of relevant organizational members' capability and process improvement. And the strategic linkage between firms can maximize the integrated capability of information system beyond the simple exchange relation between electronic data, achieving a differentiated competitive advantage. Consequently, the systematization and centralization for the maximization of SCM capability, including the infrastructure construction based on the system compatibility and reliability for information integration, should be preceded before the modeling of the integrated capability for optimum supply chain and the best process management in the smart era.

Establishment of Navigational Risk Assessment Model Combining Dynamic Ship Domain and Collision Judgement Model (선박동적영역과 충돌위험평가식을 결합한 항해위험성평가모델 전개)

  • Kim, Won-Ouk;Kim, Chang-Je
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.24 no.1
    • /
    • pp.36-42
    • /
    • 2018
  • This paper considers the Marine Traffic Risk Assessment for fixed and moving targets, which threaten officers during a voyage. The Collision Risk Assessment Formula was calculated based on a dynamic ship domain considering the length, speed and maneuvering capability of a vessel. In particular, the Navigation Risk Assessment Model that is used to quantitatively index the effect of a ship's size, speed, etc. has been reviewed and improved using a hybrid combination of a vessel's dynamic area and the Collision Risk Assessment Formula. Accordingly, a new type of Marine Traffic Risk Assessment Model has been suggested giving consideration to the Speed Length Ratio, which was not sufficiently reflected in the existing Risk Assessment Model. The larger the Speed Length Ratio (dimensionless speed), the higher the CJ value. That is, the CJ value is presented well by the Speed Length Ratio. When the Speed Length Ratio is large, states ranging from [Caution], [Warning], [Dangerous] or [Very Dangerous] are presented from a greater distance than when the Speed Length Ratio is small. The results of this study, can be used for route and port development, including dangerous route avoidance, optimum route planning, breakwater width, bridge span, etc. as well as the development of costal navigation safety charts. This research is also applicable for the selection of optimum ship routing and the prevention of collisions for smart ships such as autonomous vessels.

A Study on the Design of Data Model for Route Information based on S-100 (S-100 기반의 항로정보 데이터 모델 설계에 관한 연구)

  • PARK, Byung-Moon;KIM, Jae-Myeong;CHOI, Yun-Soo;OH, Se-Woong;JUNG, Min
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.22 no.2
    • /
    • pp.50-64
    • /
    • 2019
  • According to the Maritime Safety Act, there are all 34 routes including 5 traffic safety zones, 3 traffic separation schemes, 26 routes designated by regional maritime affairs departments in the Republic of Korea. In the SOLAS convention, the route information should be is effectively used for the safe navigation. However, the route information is complicatedly composed of the location of the route, the navigation rule by each route, the restriction of the navigation, and the anchorages. Moreover, the present method of providing information using the navigational chart and other publications is not effective for users to grasp the navigational information. Therefore, it was conducted to study the design of the S-100 based routing information data model developed by the International Hydrographic Organization to find ways to more effectively provide route information. To do this, the analysis of route requirement, selection of items, encoding test and users' review were carried out. Through expert user review, it was evaluated that the study on the design of the route information data model can be utilized as a good basic data for the route information integration service. Future research on the development of route information data models is expected to provide integrated route information services.

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.

A Simulation-Based Investigation of an Advanced Traveler Information System with V2V in Urban Network (시뮬레이션기법을 통한 차량 간 통신을 이용한 첨단교통정보시스템의 효과 분석 (도시 도로망을 중심으로))

  • Kim, Hoe-Kyoung
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.5
    • /
    • pp.121-138
    • /
    • 2011
  • More affordable and available cutting-edge technologies (e.g., wireless vehicle communication) are regarded as a possible alternative to the fixed infrastructure-based traffic information system requiring the expensive infrastructure investments and mostly implemented in the uninterrupted freeway network with limited spatial system expansion. This paper develops an advanced decentralized traveler information System (ATIS) using vehicle-to-vehicle (V2V) communication system whose performance (drivers' travel time savings) are enhanced by three complementary functions (autonomous automatic incident detection algorithm, reliable sample size function, and driver behavior model) and evaluates it in the typical $6{\times}6$ urban grid network with non-recurrent traffic state (traffic incident) with the varying key parameters (traffic flow, communication radio range, and penetration ratio), employing the off-the-shelf microscopic simulation model (VISSIM) under the ideal vehicle communication environment. Simulation outputs indicate that as the three key parameters are increased more participating vehicles are involved for traffic data propagation in the less communication groups at the faster data dissemination speed. Also, participating vehicles saved their travel time by dynamically updating the up-to-date traffic states and searching for the new route. Focusing on the travel time difference of (instant) re-routing vehicles, lower traffic flow cases saved more time than higher traffic flow ones. This is because a relatively small number of vehicles in 300vph case re-route during the most system-efficient time period (the early time of the traffic incident) but more vehicles in 514vph case re-route during less system-efficient time period, even after the incident is resolved. Also, normally re-routings on the network-entering links saved more travel time than any other places inside the network except the case where the direct effect of traffic incident triggers vehicle re-routings during the effective incident time period and the location and direction of the incident link determines the spatial distribution of re-routing vehicles.

Development and application of GLS OD matrix estimation with genetic algorithm for Seoul inner-ringroad (유전알고리즘을 이용한 OD 추정모형의 개발과 적용에 관한 연구 (서울시 내부순환도로를 대상으로))

  • 임용택;김현명;백승걸
    • Journal of Korean Society of Transportation
    • /
    • v.18 no.4
    • /
    • pp.117-126
    • /
    • 2000
  • Conventional methods for collecting origin-destination trips have been mainly relied on the surveys of home or roadside interview. However, the methods tend to be costly, labor intensive and time disruptive to the trip makers, thus the methods are not considered suitable for Planning applications such as routing guidance, arterial management and information Provision, as the parts of deployments in Intelligent Transport Systems Motivated by the problems, more economic ways to estimate origin-destination trip tables have been studied since the late 1970s. Some of them, which have been estimating O-D table from link traffic counts are generally Entropy maximizing, Maximum likelihood, Generalized least squares(GLS), and Bayesian inference estimation etc. In the Paper, with user equilibrium constraint we formulate GLS problem for estimating O-D trips and develop a solution a1gorithm by using Genetic Algorithm, which has been known as a g1oba1 searching technique. For the purpose of evaluating the method, we apply it to Seoul inner ringroad and compare it with gradient method proposed by Spiess(1990). From the resu1ts we fond that the method developed in the Paper is superior to other.

  • PDF

APPLYING ENTERPRISE GIS TO DISASTER MANAGEMENT AT KANGWON PROVINCE

  • Yoon, Hoon-Joo;Ryu, Joong-Hi;Kim, Jung-Dai;Park, Hong-Gi
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.9 no.2 s.18
    • /
    • pp.29-36
    • /
    • 2001
  • The purpose of this paper is to describe the Disaster Management System Development of Enterprise GIS at the Kangwon Province in Korea. This project is included into 'the Kangwon Enterprise GIS 21 plan'. The Division of Disaster Management is in the middle of the 2-year project of the Disaster Management System development, appropriate for business performed at the Departments of Forestry, Culture, Environment, Tourism, etc. At the 1st phase of CIS implementation, for more than half a year we focused on the necessity of management of disasters. In the planning process, we needed long-term information on the whole area of Kangwon. In the assessment and response processes, we needed real-time data from Korean Meteorological Administration and other agencies. All the above information was carefully studied and referred to. ESRI's new GIS technologies solve the natural hazard/disaster problems. For example, hazardous materials routing often needs to be found the least expensive path through a roadway network. In the circumstances given, we can choose the departure point and destination of the vehicle, which carries the materials. It's also possible to minimize overall risk and costs of disaster problems by making a plan of people and possessions evacuation from the disaster area in short time limits. We can meet all the above goals using the latest ESRI's technologies.

  • PDF

Planning Evacuation Routes with Load Balancing in Indoor Building Environments (실내 빌딩 환경에서 부하 균등을 고려한 대피경로 산출)

  • Jang, Minsoo;Lim, Kyungshik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.7
    • /
    • pp.159-172
    • /
    • 2016
  • This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.