• Journal of Navigation and Port Research
• /
• v.33 no.7
• /
• pp.477-482
• /
• 2009

In this paper the order picking problem in warehouses is considered, a topic which has received considerable attention from the international academic body in recent years. The order picking problem deals with the retrieval of order items from prespecified locations in the warehouse, and its objective is usually the minimization of travel time or travel distance. Hence, a well-thought order picking policy in combination with an appropriate storage policy will enhance warehouse efficiency and reduce operational costs. This paper starts with a literature overview summarizing approaches to routing order pickers, assigning stock-keeping units to pick locations and designing warehouse layouts. Since the layout design might affect both storage and routing policies, the three factors are interdependent with respect to order picking performance. To test these interdependencies, a simulation experiment was set up, involving two types of warehouse layout, four types of storage policy, five well-known heuristics and five sizes of order picking list. Our results illustrate that from the point of view of order picking distance minimization it is recommended to equip the warehouse with a third cross aisle, although this comes at the cost of a certain space loss. Additionally, we propose a set of most appropriate matches between order picking heuristics and storage policies. Finally, we give some directions for further research and recommend an integrated approach involving all factors that affect warehouse efficiency.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.127-134
• /
• 1992

In this paper, we first examine the stochastic behavior associated with storage/retrieval process under COL policy, and give analytical results such as the limiting distributions of the number of items in the system and the expected travel distance. We also investigate the phenomenon of natural zoning, that is, the tendency of similar items to group themselves together, when two types of items with different turnover rates are stored and retrieved. Natural zoning refers to this grouping occurring under the seemingly unbiased policy COL. We show that zoning can occur naturally with batch arrivals to the storage system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.96-104
• /
• 2017

A one-shot system (device) refers to a system that is stored for a long period of time and is then disposed of after a single mission because it is accompanied by a chemical reaction or physical destruction when it operates, such as shells, munitions in a defense weapon system and automobile airbags. Because these systems are primarily related with safety and life, it is required to maintain a high level of storage reliability. Storage reliability is the probability that the system will operate at a particular point in time after storage. Since the stored one-shot system can be confirmed only through inspection, periodic inspection and maintenance should be performed to maintain a high level of storage reliability. Since the one-shot system is characterized by a large loss in the event of a failure, it is necessary to determine an appropriate inspection period to maintain the storage reliability above the reliability goal. In this study, we propose an optimal inspection policy that minimizes the total cost while exceeding the reliability goal that the storage reliability is set in advance for the one-shot system in which periodic inspections are performed. We assume that the failure time is the Weibull distribution. And the cost model is presented considering the existing storage reliability model by Martinez and Kim et al. The cost components to be included in the cost model are the cost of inspection $c_1$, the cost of loss per unit time between failure and detection $c_2$, the cost of minimum repair of the detected breakdown of units $c_3$, and the overhaul cost $c_4$ of $R_s{\leq}R_g$. And in this paper, we will determine the optimal inspection policy to find the inspection period and number of tests that minimize the expected cost per unit time from the finite lifetime to the overhaul. Compare them through numerical examples.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1296-1304
• /
• 1999

본 논문은 다수의 고객들에게 실시간 재생 서비스를 제공하는 주문형 비디오 서버에서 데이타 검색의 효율을 높이기 위한 저장 시스템의 구조와 그에 따른 배치 정책을 제안한다. 주문형 비디오 저장 서버에서 동시에 보다 많은 고객들에게 그들이 원하는 서비스를 제공하기 위해서는 여러 분야에서의 다양한 정책들이 고려될 수 있으나, 특히 저장 매체들을 어떤 구조로 구성하고 여기에 비디오 객체들을 어떻게 배치할 것인가는 검색 효율과 직접 관계되는 중요한 문제이다. 본 논문에서는 디스크 배열 형태로 구성된 저장 시스템을 디스크 성능을 고려하여 재구성하고, 비디오 객체들을 저장할 때 저장하고자 하는 데이타의 특성들과 저장 구조를 함께 고려하여 검색 효율을 극대화할 수 있는 배치 방법을 제안한다. 마지막으로 제안된 정책의 검색 효율을 검증하기 위해 다양한 실험을 통하여 기존의 배치 정책들과 비교하고 성능을 평가한다.Abstract In this paper, we propose the structure of storage system and a placement policy to provide many clients with real-time playback services efficiently in VOD(video-on-demand) server. Though policies in various areas being considered to provide more clients with services of degree requested by them simultaneously in VOD storage server, it is important how to construct storage media and to place video objects on it for retrieval efficiency. In this paper, we reorganize a large disk array with disks performance and place video objects using the placement policy considering both characteristics of video data and the structure of storage system for maximizing retrieval efficiency. Lastly, we simulate the proposed policy and conventional policies through various environments, compare our policy with others n evaluate the performance of our policy.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.579-589
• /
• 1998

Full turnover-based storage policy (FULL) is often used to minimize the travel time needed to perform storage/retrieval operations in automated storage/retrieval systems (AS/RSs). This paper presents an approach for determining the required storage capacity for a unit load AS/RS under the FULL. An analytic model is formulated such that the total cost related to storage space and space shortage is minimized while satisfying a desired service level. To solve the model, some analytic properties are derived and based on them, an iterative search algorithm which always generates optimal solutions is developed. To illustrate the validity of the approach, an application is provided when the standard economic-order-quantity inventory model is used.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.05a
• /
• pp.145-153
• /
• 1999

We consider a Direct Input Output Manufacturing System(DIOMS) which has a munber of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the machine centers located at either one or both sides of the As/Rs. This report studies the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the S/R machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this report, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.505-516
• /
• 2007

In this paper, we provide some fundamental properties and basic theoretical results of K-class-based dedicated storage policy in a unit load system assuming the constant-space assumption that the number of storage locations for a class is not the maximum aggregate inventory position for a class but the sum of space requirement for products assigned to the class. The main theorem is that there exists a (K+1) -class-based storage layout whose expexted single command (SC) travel time is not greater than that of a K-class-based storage layout, i.e, $E(SC^*_{K+1}){\leq}E(SC^*_K)\;for\;K=1,{\cdots}$, (n-1).

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.765-774
• /
• 2001

In this paper, we proposed the striping policy for the storage nodes in the Linux-based parallel media stream server. We newly developed a storage clustering architecture, and named it as a system RAID architecture. In this system, many storage cluster nodes are grouped to operate as a single server. This system uses unique striping policy to distribute multimedia files into the parallel storage nodes. If a service request occurs, each storage cluster node transmits striped files concurrently to the clients. This scheme can provide the fair distribution of the preprocessing load in all storage cluster nodes. The feature of this system is a relative striping policy based on the file types, service types, and the number of storage nodes to provide the best service.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.30-38
• /
• 2016

Shuttle-Based Storage/Retrieval System (SBS/RS) is relatively new to industry. The system is in the category of Automated Storage/Retrieval System (AS/RS), but it is different in that the SBS/RS uses shuttles as Storage/Retrieval (SR) machine instead using a stacker crane. The shuttles are assigned to each tier on multi-tier system and operated for pick-up or drop-off order. Since the system can handle multiple orders simultaneously, it can provide much higher throughput than that of general AS/RS with single stocker crane. Thus, this new system is well fit to recent tendency of increasing small quantity batch production and orders. One of the drawback of this system is that it needs a lot of investment to set up. The efficient operation of the system would be one of the critical matters to increase economic efficiency of capital investment. In this study, we focused on the dwell point policy for shuttles to find efficient way of operating the system. There are four basic policies for the dwell point and we had simulation-based experiment for two different scenarios based on the speed of the shuttle and inter-arrival time of the loads coming to the system combined with four different policies. As it was mentioned above, this SBS/RS relatively new to the field and there is no such experiment shown on previous research and the study of dwell point policy for this SBS/RS could provide the direct comparison of each policy with different hardware specification; the capability of the system. The policy that achieves most efficient operation among the given environment is proposed and the usability of the system is discussed.