• Title/Summary/Keyword: Order Scheduling

Search Result 847, Processing Time 0.027 seconds

Efficient Incorporation of Tertiary Storage in a Multimedia DBMS (멀티미디어 DBMS에서 3차 저장장치의 효율적 활용 기법)

  • Mun, Chan-Ho;Gang, Hyeon-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1724-1737
    • /
    • 1999
  • Multimedia data service applications have to store and manipulate LOBs(unstructured large objects) composing multimedia data. As such, the tertiary storage devices such as an optical disk jukebox and a tape library that consist of a number of platters (the disks in case of an optical disk jukebox and the cartridge tapes in case of a tape library) have been considered essential for the storage system of a DBMS in order to efficiently support storage and management of vary large volume of data. Since the latency with tertiary storage is too long, the schemes for efficient retrieval of LOBs out of tertiary storage need to be investigated. In this paper, we investigated the tertiary I/O Considering the performance characteristics of the LOBs, we proposed various I/O scheduling heuristic algorithms that reduce latency in query processing with LOB retrieval from tertiary storage, and evaluated their performance through a detailed simulation.

  • PDF

A Distributed Spatial Indexing Technique based on Hilbert Curve and MBR for k-NN Query Processing in a Single Broadcast Channel Environment (단일방송채널환경에서 k-최근접질의 처리를 위한 힐버트 곡선과 최소영역 사각형 기반의 분산 공간 인덱싱 기법)

  • Yi, Jung-Hyung;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.37 no.4
    • /
    • pp.203-208
    • /
    • 2010
  • This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.

A Case Study on Productivity Improvement by a Discrete Event-Driven Simulation System (이산사건 시뮬레이션 시스템을 활용한 생산성 개선 사례 연구)

  • Kim, Sangtae;Shin, Moonsoo;Ryu, Kwangyeol;Cho, Yongju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.149-158
    • /
    • 2015
  • Up-to-date manufacturing companies have faced a market-driven environment of pull production order. There should be a difference in operating manufacturing resources according to the type, quantity, and delivery time of manufactured products, because the process situation in pull production is changed by customer orders. And it should be taken into account from the stage of preparing for production such as process design and the placement and utilization of manufacturing resources. However, the feasibility of production plans is limited because most of small manufacturing businesses make production/supply plan of the parts and products assuming that equipment abilities in scheduling is sufficient without managing process standard information systemically. In this study, a discrete event simulation system based on BOM (bill of material), that is F-OPIS (online productivity innovation system), is introduced and a case study on application of the system leading to improving productivities is presented. F-OPIS deals with a decision-problem on production management and it is specialized for small-and- medium sized manufacturing companies. The target company of this case study is a typical small-and-medium sized manufacturing company in Korea, that produces various machined parts. The target company adopts make-to-stock production management to prevent tardy delivery because of fluctuations in demand. Therefore, it is required to apply an efficient inventory control solution for improving productivities. In this paper, based on the constraints of working capacity of manufacturing resources, the bottleneck process is analyzed as production conditions are changed. Consequently, an improvement plan is proposed, that eventually enhances overall utilization rates of resources in the bottleneck process and reduces overall production lead-time and inventory level.

Two-Level Hierarchical Production Planning for a Semiconductor Probing Facility (반도체 프로브 공정에서의 2단계 계층적 생산 계획 방법 연구)

  • Bang, June-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.159-167
    • /
    • 2015
  • We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

The Train Conflict Resolution Model Using Time-space Network (시공간 네트워크를 이용한 열차 경합해소모형)

  • Kim, Young-Hoon;Rim, Suk-Chul
    • Journal of the Korean Society for Railway
    • /
    • v.18 no.6
    • /
    • pp.619-629
    • /
    • 2015
  • The train conflict resolution problem refers to an adjustment of the train operation schedule in order to minimize the delay propagation when a train conflict is predicted or when a train conflict occurs. Previous train studies of train conflict resolutions are limited in terms of the size of the problems to be solved due to exponential increases in the variables. In this paper, we propose a train conflict resolution model using a time-space network to solve the train conflict situation in the operational phase. The proposed model adjusts the size of the problem by giving only the dwell tolerance in the time-space network only for stops at the station after a train conflict. In addition, the proposed model can solve large problems using a path flow variable. The study presents a train delay propagation analysis and experimental results of train conflict resolution assessments as well using the proposed model.

CONDITION MONITORING USING EMPIRICAL MODELS: TECHNICAL REVIEW AND PROSPECTS FOR NUCLEAR APPLICATIONS

  • Heo, Gyun-Young
    • Nuclear Engineering and Technology
    • /
    • v.40 no.1
    • /
    • pp.49-68
    • /
    • 2008
  • The purpose of this paper is to extensively review the condition monitoring (CM) techniques using empirical models in an effort to reduce or eliminate unexpected downtimes in general industry, and to illustrate the feasibility of applying them to the nuclear industry. CM provides on-time warnings of system states to enable the optimal scheduling of maintenance and, ultimately, plant uptime is maximized. Currently, most maintenance processes tend to be either reactive, or part of scheduled, or preventive maintenance. Such maintenance is being increasingly reported as a poor practice for two reasons: first, the component does not necessarily require maintenance, thus the maintenance cost is wasted, and secondly, failure catalysts are introduced into properly working components, which is worse. This paper first summarizes the technical aspects of CM including state estimation and state monitoring. The mathematical background of CM is mature enough even for commercial use in the nuclear industry. Considering the current computational capabilities of CM, its application is not limited by technical difficulties, but by a lack of desire on the part of industry to implement it. For practical applications in the nuclear industry, it may be more important to clarify and quantify the negative impact of unexpected outcomes or failures in CM than it is to investigate its advantages. In other words, while issues regarding accuracy have been targeted to date, the concerns regarding robustness should now be concentrated on. Standardizing the anticipated failures and the possibly harsh operating conditions, and then evaluating the impact of the proposed CM under those conditions may be necessary. In order to make the CM techniques practical for the nuclear industry in the future, it is recommended that a prototype CM system be applied to a secondary system in which most of the components are non-safety grade. Recently, many activities to enhance the safety and efficiency of the secondary system have been encouraged. With the application of CM to nuclear power plants, it is expected to increase profit while addressing safety and economic issues.

Data-driven Interactive Planning Methodology for EPC Plant Projects (EPC 플랜트 프로젝트의 초기 공정계획을 위한 통합 데이터 활용 방안)

  • Wang, Hankyeom;Choi, Jaehyun
    • Korean Journal of Construction Engineering and Management
    • /
    • v.20 no.2
    • /
    • pp.95-104
    • /
    • 2019
  • EPC plant projects are large and complex, requiring systematic working methodologies, accumulated data, and thorough planning through communications between the entities. In this study, the method of extracting the process planning information using asset data of the plant project and using it to present the initial process plan is presented through the concept of IAP(Interactive Planning). In order to carry out the effective IAP at the early stage of the project, this study extracted the schedule element information from the asset data, created the process plan for each work package, and applied it to the sample project case. Through the proposed IAP methodology, it is possible to promote the utilization of asset data, to identify schedule risks, and to develop countermeasures, which can form the basis for establishing the process management strategy to successfully complete the project.

Logistics Allocation and Monitoring System based on Map and GPS Information (Map과 GPS 기반의 혼적을 고려한 물류할당 및 모니터링 시스템)

  • Park, Chulsoon;Bajracharya, Larsson
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.4
    • /
    • pp.138-145
    • /
    • 2018
  • In the field of optimization, many studies have been performed on various types of Vehicle Routing Problem (VRP) for a long time. A variety of models have been derived to extend the basic VRP model, to consider multiple truck terminal, multiple pickup and delivery, and time windows characteristics. A lot of research has been performed to find better solutions in a reasonable time for these models with heuristic approaches. In this paper, by considering realtime traffic characteristics in Map Navigation environment, we proposed a method to manage realistic optimal path allocation for the logistics trucks and cargoes, which are dispersed, in order to realize the realistic cargo mixing allowance and time constraint enforcement which were required as the most important points for an online logistics brokerage service company. Then we developed a prototype system that can support above functionality together with delivery status monitoring on Map Navigation environment. First, through Map Navigation system, we derived information such as navigation-based travel time required for logistics allocation scheduling based on multiple terminal multiple pickup and delivery models with time constraints. Especially, the travel time can be actually obtained by using the Map Navigation system by reflecting the road situation and traffic. Second, we made a mathematical model for optimal path allocation using the derived information, and solved it using an optimization solver. Third, we constructed the prototype system to provide the proposed method together with realtime logistics monitoring by arranging the allocation results in the Map Navigation environment.

Dynamic Routing and Priority-based Data Transmission Schemes in Avionic Ethernet for Improving Network QoS (항공전자 이더넷의 네트워크 성능 향상을 위한 동적 라우팅 기법 및 우선순위기반 데이터 전송 기법)

  • Lee, Won Jin;Kim, Yong Min
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.4
    • /
    • pp.302-308
    • /
    • 2019
  • Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

Design and Implementation of BioAPI v2.0 based BSP Conformance Test Suite (BioAPI v2.0 기반 BSP 표준 적합성 시험 도구의 설계 및 구현)

  • Jang Ji-Hyeon;Lee Dong-Geun;Kim Jae-Sung;Kim Hak-Il
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.3
    • /
    • pp.129-141
    • /
    • 2006
  • The purpose of this paper is to design Conformance Test Suite for BSP(Biometric Service Provider) based on BioAPI(Biometric Application Programming Interface) v2.0. The proposed BioAPI Conformance Test Suite enables users to test BSP with framework independently. A test scheduling tool has been embodied to use Test Assertion in the form of XML. In order to demonstrate the performance of the Conformance Test Suite, the experiment was performed by using both verification and identification BSPs. As the results of this experiment, we were able to determinate whether BSPs based on BioAPI v2.0 satisfied standard requirements or not.