Modeling Conveyor Merges in Zone Picking Systems

In many order picking and sorting systems conveyors are used to transport products through the system and to merge multiple flows of products into one single flow. In practice, conveyor merges are potential points of congestion, and consequently can lead to a reduced throughput. In this paper, we study merges in a zone picking system. The performance of a zone picking system is, for a large part, determined by the performance of the merge locations. We model the system as a closed queueing network that describes the conveyor, the pick zones, and the merge locations. The resulting model does not have a product-form stationary queue-length distribution. This makes exact analysis practically infeasible. Therefore, we approximate the behavior of the model using the aggregation technique, where the resulting subnetworks are solved using matrix-geometric methods. We show that the approximation model allows us to determine very accurate estimates of the throughput when compared with simulation. Furthermore, our model is in particular well suited to evaluate many design alternatives, in terms of number of zones, zone buffer lengths, and maximum number of totes in the systems. It also can be used to determine the maximum throughput capability of the system and, if needed, modify the system in order to meet target performance levels

NA61/SHINE facility at the CERN SPS: beams and detector system

NA61/SHINE (SPS Heavy Ion and Neutrino Experiment) is a multi-purpose experimental facility to study hadron production in hadron-proton, hadron-nucleus and nucleus-nucleus collisions at the CERN Super Proton Synchrotron. It recorded the first physics data with hadron beams in 2009 and with ion beams (secondary 7Be beams) in 2011. NA61/SHINE has greatly profited from the long development of the CERN proton and ion sources and the accelerator chain as well as the H2 beamline of the CERN North Area. The latter has recently been modified to also serve as a fragment separator as needed to produce the Be beams for NA61/SHINE. Numerous components of the NA61/SHINE set-up were inherited from its predecessors, in particular, the last one, the NA49 experiment. Important new detectors and upgrades of the legacy equipment were introduced by the NA61/SHINE Collaboration. This paper describes the state of the NA61/SHINE facility - the beams and the detector system - before the CERN Long Shutdown I, which started in March 2013

Linearized Data Center Workload and Cooling Management

With the current high levels of energy consumption of data centers, reducing power consumption by even a small percentage is beneficial. We propose a framework for thermal-aware workload distribution in a data center to reduce cooling power consumption. The framework includes linearization of the general optimization problem and proposing a heuristic to approximate the solution for the resulting Integer Linear Programming (ILP) problems. We first define a general nonlinear power optimization problem including several cooling parameters, heat recirculation effects, and constraints on server temperatures. We propose to study a linearized version of the problem, which is easier to analyze. As an energy saving scenario and as a proof of concept for our approach, we also consider the possibility that the red-line temperature for idle servers is higher than that for busy servers. For the resulting ILP problem, we propose a heuristic for intelligent rounding of the fractional solution. Through numerical simulations, we compare our heuristics with two baseline algorithms. We also evaluate the performance of the solution of the linearized system on the original system. The results show that the proposed approach can reduce the cooling power consumption by more than 30 percent compared to the case of continuous utilizations and a single red-line temperature

Vertical or Horizontal Transport? - Comparison of robotic storage and retrieval systems

Autonomous vehicle-based storage and retrieval systems are commonly used in e-commerce fulfillment as they allow a high and flexible throughput capacity. In these systems, roaming robots transport loads between a storage location and a workstation. Two main variants exist: Horizontal, where the robots only move horizontally and use lifts for vertical transport and a new variant Vertical, where the robots can also travel vertically in the rack. This paper builds a framework to analyze the performance of the vertical system and to compare its throughput capacity with the horizontal system. We build closed-queueing network models for this that in turn are used to optimize the design. The results show that the optimal height-to-width ratio of a vertical system is around 1. As a large number of system robots may lead to blocking and delays, we compare the effect of two different robot blocking protocols on the system throughput: robot Recirculation and Wait-On-Spot. The Wait-On-Spot policy produces a higher system throughput when the number of robots in the system is small. However, for a large number of robots in the system, the Recirculation policy dominates the Wait-On-Spot policy. Finally, we compare the operational costs of the vertical and the horizontal transport system. For systems with one load/unload (L/U) point, the vertical system always produces a similar or higher system throughput, with a lower operating cost comp

Capacity Analysis of Sequential Zone Picking Systems

This paper develops a capacity model for sequential zone picking systems. These systems are popular internal transport and order-picking systems because of their scalability, flexibility, high-throughput ability, and fit for use for a wide range of products and order profiles. The major disadvantage of such systems is congestion and blocking under heavy use, leading to long order throughput times. To reduce blocking and congestion, most systems use the block-and-recirculate protocol to dynamically manage workload. In this paper, the various elements of the system, such as conveyor lanes and pick zones, are modeled as a multiclass block-and-recirculate queueing network with capacity constraints on subnetworks. Because of this blocking protocol, the stationary distribution of the queueing network is highly intractable. We propose an approximation method based on jumpover blocking. Multiclass jump-over queueing networks admit a product-form stationary distribution and can be efficiently evaluated by mean value analysis and Norton’s theorem. This method can be applied during the design phase of sequential zone picking systems to determine the number of segments, number and length of zones, buffer capacities, and storage allocation of products to zones to meet performance targets. For a wide range of parameters, the results show that the relative error in the system throughput is typically less than 1% compared with simulation

A generic learning multi-agent-system approach for spatio-temporal-, thermal- and energy-aware scheduling

This paper proposes an agent based approach to the scheduling of jobs in data centers under thermal constraints. The model encompasses both temporal and spatial aspects of the temperature evolution using a unified model, taking into account the dynamics of heat production and dissipation. Agents coordinate to eventually move jobs to the best suitable place and to adapt dynamically the frequency settings of the nodes to the best combination. Several objectives of the agents are compared under different circumstances by an extensive set of experiments