A survey on performance analysis of warehouse carousel systems

This paper gives an overview of recent research on the performance evaluation and design of carousel systems. We discuss picking strategies for problems involving one carousel, consider the throughput of the system for problems involving two carousels, give an overview of related problems in this area, and present an extensive literature review. Emphasis has been given on future research directions in this area

On two-echelon inventory systems with Poisson demand and lost sales

We derive approximations for the service levels of two-echelon inventory systems with lost sales and Poisson demand. Our method is simple and accurate for a very broad range of problem instances, including cases with both high and low service levels. In contrast, existing methods only perform well for limited problem settings, or under restrictive assumptions.\u

Performance evaluation of warehouses with automated storage and retrieval technologies.

In this dissertation, we study the performance evaluation of two automated warehouse material handling (MH) technologies - automated storage/retrieval system (AS/RS) and autonomous vehicle storage/retrieval system (AVS/RS). AS/RS is a traditional automated warehouse MH technology and has been used for more than five decades. AVS/RS is a relatively new automated warehouse MH technology and an alternative to AS/RS. There are two possible configurations of AVS/RS: AVS/RS with tier-captive vehicles and AVS/RS with tier-to-tier vehicles. We model the AS/RS and both configurations of the AVS/RS as queueing networks. We analyze and develop approximate algorithms for these network models and use them to estimate performance of the two automated warehouse MH technologies. Chapter 2 contains two parts. The first part is a brief review of existing papers about AS/RS and AVS/RS. The second part is a methodological review of queueing network theory, which serves as a building block for our study. In Chapter 3, we model AS/RSs and AVS/RSs with tier-captive vehicles as open queueing networks (OQNs). We show how to analyze OQNs and estimate related performance measures. We then apply an existing OQN analyzer to compare the two MH technologies and answer various design questions. In Chapter 4 and Chapter 5, we present some efficient algorithms to solve SOQN. We show how to model AVS/RSs with tier-to-tier vehicles as SOQNs and evaluate performance of these designs in Chapter 6. AVS/RS is a relatively new automated warehouse design technology. Hence, there are few efficient analytical tools to evaluate performance measures of this technology. We developed some efficient algorithms based on SOQN to quickly and effectively evaluate performance of AVS/RS. Additionally, we present a tool that helps a warehouse designer during the concepting stage to determine the type of MH technology to use, analyze numerous alternate warehouse configurations and select one of these for final implementation

Optimizing the Performance of Robotic Mobile Fulfillment Systems

A robotic mobile fulfillment system is a novel type of automated part-to-picker material handling system. In this type of system, robots transport mobile shelves, called pods, containing items between the storage area and the workstations. It is well suited to e-commerce, due to its modularity and it's ability to adapt to changing orders patterns. Robots can nearly instantaneously switch between inbound and outbound tasks, pods can be continually repositioned to allow for automatic sorting of the inventory, pods can contain many different types of items, and unloaded robots can drive underneath pods, allowing them to use completely different routes than loaded robots. This thesis studies the performance of robotic mobile fulfillment systems by solving decision problems related to warehouse design, inventory and resource allocation, and real-time operations. For warehouse design, a new queueing network is developed that incorporates realistic robot movement, storage zones, and multi-line orders. For inventory allocation, we develop a new type of queueing network, the cross-class matching multi-class semi-open queueing network, which can be applied to other systems as well. Resource (re)allocation is modeled by combining queueing networks with Markov decision processes while including time-varying demand. This model compares benchmark policies from practice wit

A Novel Approach to Analyze Inventory Allocation Decisions in Robotic Mobile Fulfillment Systems

The Robotic Mobile Fulfillment System is a newly developed automated, parts-to-picker material handling system. Storage shelves, also known as inventory pods, are moved by robots between the storage area and the workstations, which means that they can be continually repositioned during operations. This paper develops a queueing model for optimizing three key decision variables: (1) the number of pods per product (2) the ratio of the number of pick to the number of replenishment stations, and (3) the replenishment level per pod. We show that too few or too many pods per product leads to unnecessarily long order throughput times, that the ratio of the number of pick to the number of replenishment stations can be optimized for order throughput time, and that waiting to replenish until a pod is completely empty can severely decrease throughput performance

Variation in Lifting Behavior During a Highly Repetitive Manual Material Task

Presenters will provide

On Predictive Modeling for Optimizing Transaction Execution in Parallel OLTP Systems

A new emerging class of parallel database management systems (DBMS) is designed to take advantage of the partitionable workloads of on-line transaction processing (OLTP) applications. Transactions in these systems are optimized to execute to completion on a single node in a shared-nothing cluster without needing to coordinate with other nodes or use expensive concurrency control measures. But some OLTP applications cannot be partitioned such that all of their transactions execute within a single-partition in this manner. These distributed transactions access data not stored within their local partitions and subsequently require more heavy-weight concurrency control protocols. Further difficulties arise when the transaction's execution properties, such as the number of partitions it may need to access or whether it will abort, are not known beforehand. The DBMS could mitigate these performance issues if it is provided with additional information about transactions. Thus, in this paper we present a Markov model-based approach for automatically selecting which optimizations a DBMS could use, namely (1) more efficient concurrency control schemes, (2) intelligent scheduling, (3) reduced undo logging, and (4) speculative execution. To evaluate our techniques, we implemented our models and integrated them into a parallel, main-memory OLTP DBMS to show that we can improve the performance of applications with diverse workloads.Comment: VLDB201

Inventory Allocation in Robotic Mobile Fulfillment Systems

A Robotic Mobile Fulfillment System is a recently developed automated, parts-to- picker material handling system. Robots can move storage shelves, also known as inventory pods, between the storage area and the workstations and can continually reposition them during operations. This paper shows how to optimize three key decision variables: (1) the number of pods per product (2) the ratio of the number of pick stations to replenishment stations, and (3) the replenishment level per pod. Our results show that throughput performance improves substantially when inventory is spread across multiple pods, when an optimum ratio between the number of pick stations to replenishment stations is achieved and when a pod is replenished before it is completely empty. This paper contributes methodologically by introducing a new type of Semi-Open Queueing Networks (SOQN): cross-class matching multi- class SOQN, by deriving necessary stability conditions, and by introducing a novel interpretation of the classes