• 산업공학
• /
• 제15권2호
• /
• pp.159-171
• /
• 2002

Data Warehouses integrate data from multiple heterogeneous information sources and transform them into a multidimensional representation for decision support applications. Data warehousing has emerged as one of the most powerful tools in delivering information to users. Most previous researches have focused on marketing, customer service, financing, and insurance industry. Further, relatively less research has been done on data warehouse systems in the complex manufacturing industry such as ship production, which is characterized complex product structures and production processes. In the ship production, data warehouse systems is a requisite for effective cost analysis because collecting and analysis of diverse and large of cost-related(material/production cost, productivity) data in its operational systems, was becoming increasingly cumbersome and time consuming. This paper proposes architecture of the data warehouse systems to support cost analysis in the ship production. Also, in order to illustrate the usefulness of the proposed architecture, the prototype system is designed and implemented with the object of the enterprise of producing a large-scale ship.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.1-8
• /
• 2011

Controlling industrial vehicle operated by human in warehouse was not simple since the information transfer for controlling the vehicle was not easy. However, as the technology for the WMS (Warehouse Management System) has been advanced and the PDA (Personal Digital Assistant) has come into wide use in a workplace, the control of man-operated vehicle became less difficult as do to AGVS (Automated Guided Vehicle System). This study examines the ways to improve the efficiency of warehouse operation through introducing rule of task assignment for the vehicles, particularly forklift. This study, basically, refer to AGV operation policy because a great number of studies for AGV dispatching rule have been done and the mechanism for the controlling vehicles is very similar. The workers in field prefer to simple dispatching rules such as Shortest Retrieval Time First (SRTF), Shortest Travel Time First (STTF), and Longest Waiting Time First (LWTF). However, these rules have potential disadvantage. Thus, several rules made up by combining rules mentioned above are introduced and these new rules use threshold value or evaluation formula. The effectiveness of these new rules are tested by simulation and the results are compared. This study proposes favorable dispatching rules for forklift in warehouse for the efficiency of the vehicle operation and stability of service level.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.67-75
• /
• 2006

In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view selection algorithms, all relations are considered for selection as materialized views. However, materializing all relations rather than a part results in much worse performance in terms of time and space costs. Therefore, we present an improved algorithm for selection of views to materialize using the clustering method to overcome the problem resulting from conventional view selection algorithms. In the presented algorithm, ASVMRT (Algorithm for Selection of Views to Materialize using Reduced Table), we first generate reduced tables in the data warehouse using clustering based on attribute-values density, and then we consider the combination of reduced tables as materialized views instead of a combination of the original base relations. For the justification of the proposed algorithm, we reveal the experimental results in which both time and space costs are approximately 1.8 times better than conventional algorithms.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• 한국공간정보시스템학회 논문지
• /
• 제7권3호
• /
• pp.119-130
• /
• 2005

공간 데이터 웨어하우스는 공간정보를 주제 중심적이고 통합적이며 시간성을 가지는 비 휘발성 자료로 저장하여 의사결정을 효율적으로 지원하는 시스템이다. 이 시스템은 구축기와 공간 데이터 웨어하우스 서버로 구성되어 있다. 공간 데이터 웨어하우스 서버는 구축기에서 전송된 데이터를 적재하기 위해 사용자 서비스를 정지하고, 사용자의 빠른 응답시간을 위해 적재된 데이터로 색인을 구축한다. 색인 구축을 위한 기존 기법에는 벌크 삽입 기법과 색인 전송 기법이 있다. 벌크 삽입 기법은 색인을 구축하기 위한 클러스터링 비용이 크며 검색 성능도 떨어진다. 색인 전송 기법은 주기적인 소스 데이터의 변경을 지원하지 않는 문제점이 있다. 본 논문에서는 공간 데이터 웨어하우스에서의 부분 색인을 이용한 효율적인 색인 재구축 기법을 제안한다. 제안 기법은 부분 색인을 직접 전송, 기록하며 물리적 위치 정보를 예상하여 기록할 수 있는 효율적인 색인 재구축 기법이다. 구축기에서 추출된 데이터를 공간의 근접도가 아닌 색인의 구조에 맞게 클러스터링하며, 생성된 각 클러스터를 부분 색인으로 구성하여 페이지 단위로 전송한다. 공간 데이터 웨어하우스 서버에서는 전송된 부분 색인을 저장하기 위해 물리적으로 연속된 공간을 예약하고 예약된 공간에 부분 색인을 기록한다. 기록된 부분 색인을 공간 데이터 웨어하우스 서버의 기 구축된 색인에 삽입함으로써 색인 재구축을 위한 검색, 분할, 재조정 비용이 최소화된다.

• 산업공학
• /
• 제17권spc호
• /
• pp.90-96
• /
• 2004

In this paper, we consider the joint replenishment problem of a one-warehouse, n-retailer system. We introduce a joint replenishment and delivery strategy of a warehouse and develop a mathematical model based on the proposed strategy. Two efficient algorithms are presented and compared using numerical examples. The proposed strategy is compared with the common cycle strategy for 1,600 randomly generated problems, and has been proven to be superior to the common cycle strategy.

• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.1-10
• /
• 2011

This paper addresses the analysis of the travel distance and order picking time of the vehicle in a aisle when items are picked by the batch in a warehouse system. Batching is to combine several orders in a single tour of the storage/retrieval machine. An advantage of batching is that the length of a tour for a batch of orders is shorter than the sum of the individual orders' tour lengths. The average travel distance and order picking time when a batch is picked in a aisle of the warehouse systems are analyzed for the batch size. And when the vehicle is idle, the dwell point of the vehicle to minimize to the response distance is analyzed. As the batch size is increased, average order picking time per item is decreased. The problem is analyzed and a numerical example is showed to explain the problem.

• 한국컴퓨터정보학회논문지
• /
• 제9권2호
• /
• pp.57-62
• /
• 2004

최근 데이터베이스를 이용한 정보처리응용 시스템이 증가하고 있는 추세이다. 그러나 많은 데이터를 가지고 있지만 개별적이면서 관련성이 적은 수많은 데이터를 가지는 기업은 데이터를 종합적으로 분석 처리하여 사용자 요구에 신속하게 응답할 수 있도록 다양하고 고품질의 정보 서비스를 지원하기 위한 데이터를 필요로 한다 이를 위해 데이터 웨어하우스 환경에 관한 연구가 많이 이루어지고 있다. 본 논문에서는 최종 사용자 요구에 대처하기 위해 비주얼 환경을 사용한 데이터 웨어하우스의 효과적인 설계 및 구현 결과를 보인다. 또한 기존의 일반 SQL질의를 수행할 수 있도록 한다.

• Management Science and Financial Engineering
• /
• 제17권2호
• /
• pp.1-21
• /
• 2011

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

• International Journal of Computer Science & Network Security
• /
• 제24권6호
• /
• pp.109-118
• /
• 2024

The world today is advancing towards a digital solution for every indusial domain varying from advanced engineering and medicine to training and management. The supply cycles can only be boosted via an effective management of the warehouse and a stronger hold over the logistics and inventory insights. RFID technology has been an open source tool for various MNCs and corporal organization who have progressed along a considerable drift on the charts. RFID is a methodology of analysing the warehouse and logistic data and create useful information in line to the past trends and future forecasts. The method has a high tactical accuracy and has been seen providing up to 99.57% accurate insights for the future cycle, based on the organizational capabilities and available resources. This paper discusses the implementation of RFID on field and provides results of datasets retrieved from controlled data of a practical warehouse and logistics system.