Evaluating order throughput time with variable time window batching

Given increased pressure to provide short delivery times, minimising customer order throughput time is a very important objective in warehousing operations. There are many factors that may affect the performance of an order picking system, such as layout of the warehouse, the storage strategy, the routing policy, the zoning method and the batching policy. In this study, we propose a simple travel time model and analyse the effect of order batching on the expected customer order throughput time with variable time window batching. In addition, we discussed the impact of some parameters on the batch size and the expected customer order throughput time. In the practice of Wuhan Dong Hon Logistics co. Ltd, the storage rack in the warehouse has two levels: the low storage level and the high storage level. These two levels are visited by pickers and forklifts, respectively. The classification improves the performance of order picking. In this study, we build the model based on this practice.     

The use of time series forecasting in zone order picking systems to predict order pickers’ workload

In order to differentiate from competitors in terms of customer service, warehouses accept late orders while providing delivery in a quick and timely way. This trend leads to a reduced time to pick an order. This paper introduces workload forecasting in a warehouse context, in particular a zone picking warehouse. Improved workforce planning can contribute to an effective and efficient order picking process. Most order picking publications treat demand as known in advance. As warehouses accept late orders, the assumption of a constant given demand is questioned in this paper. The objective of this study is to present time series forecasting models that perform well in a zone picking warehouse. A real-life case study demonstrates the value of applying time series forecasting models to forecast the daily number of order lines. The forecast of order lines, along with order pickers’ productivity, can be used by warehouse supervisors to determine the daily required number of order pickers, as well as the allocation of order pickers across warehouse zones. Time series are applied on an aggregated level, as well as on a disaggregated zone level. Both bottom-up and top-down approaches are evaluated in order to find the best-performing forecasting method.     

Managing warehouse efficiency and worker discomfort through enhanced storage assignment decisions

Humans are at the heart of crucial processes in warehouses. Besides the common economic goal of minimising cycle times, we therefore add in this paper the human well-being goal of minimising workers’ discomfort in the context of order picking. We propose a methodology for identifying the most suitable storage location solutions with respect to both goals. The first step in our methodology is to build data-driven empirical models for estimating cycle times and workers’ discomfort. The second step of the methodology entails the use of these empirically grounded models to formulate a bi-objective assignment problem for assigning products to storage locations. The developed methodology is subsequently tested on two actual warehouses. The results of these practical tests show that clear trade-offs exist and that optimising only for discomfort can be costly in terms of cycle time. Based on the results, we provide practical guidelines for taking storage assignment decisions that simultaneously address discomfort and travel distance considerations.     

基于遗传算法的订单拣货实时排序问题研究

根据配送中心订单拣货问题的特点,以订单客户的满意度为目标,建立了数学模型,并设计了相应的遗传算法来求解该问题。在算例中,将遗传算法与先到先服务和最早工期优先规则进行了比较,结果表明,遗传算法可以明显优化目标函数值,有助于提高配送中心的拣货效率,提高客户满意度,具有良好的实用性。     

Order picking system design: the storage assignment and travel distance estimation (SA&TDE) joint method

Of all the warehouse activities, order picking is one of the most time-consuming and expensive. In order to improve the task, several researches have pointed out the need to consider jointly the layout of the warehouse, the storage assignment strategy and the routing policy to reduce travelled distances and picking time. This paper presents the storage assignment and travel distance estimation (SA&TDE) joint method, a new approach useful to design and evaluate a manual picker-to-parts picking system, focusing on goods allocation and distances estimation. Starting from a set of picking orders received in a certain time range, this approach allows to evaluate the combinations of product codes assigned to storage locations, aisles, sections or warehouse areas and to assess the most relevant ones, for the best location and warehouse layout, with the aim of ensuring optimal picking routes, through the application of the multinomial probability distribution. A case study is developed as well, in order to clarify the concept that underlies the SA&TDE joint method, and to show the validity and the flexibility of the approach, through the calculation of the saving at different levels of detail.     

基于工作量均衡的分区同步拣货系统储位分配与评价

对基于工作量均衡的分区同步拣货系统储位分配模型中的相似系数进行了重新定义,根据被拣货物具有一定质量和体积的实际,在充分考虑品项实际订购数量的前提下,提出了当量订购次数的概念和计算公式。为检验储位分配效果,提出了系统利用率评价函数。算例结果及分析表明,修改后的模型更符合实际,有助于决策者根据不同情况作出正确决策。     

基于NSGA-Ⅱ算法的分区拣选优化

电商背景下的客户订单呈现出多品种、小批量、高频次等特点,给仓库拣选工作带来很大的挑战。为提高拣选效率,在订单完全拆分的分批策略和组合优化的行走策略下,设计了以总服务时间最小、分区工作量平衡度最优和二次分拣效率最高的多目标分区拣选模型。由于3个目标函数之间存在矛盾,设计了NSGA-II算法对多目标优化模型进行求解。通过数值实验,与传统的不拆分订单的分区拣选系统对比,发现在订单批量环境为[1,4]时,分别使总服务时间减少了43.88%,平衡度改善了84.61%,并分析了区域个数、订单总数和订单批量环境对系统效率的影响。     

The use of bucket brigades in zone order picking systems

As the transactions through electronic commerce and TV home shopping increase, the warehouses often receive a large amount of small orders to be picked within tight time windows. One of the important warehousing activities is order picking, the process of retrieving a number of items from warehouse storage to meet a number of independent customer orders. This paper examines a new order picking method, bucket brigade order picking (BB picking). Bucket brigade is a way of coordinating workers who progressively perform a set of operations on a flow line. In the BB picking system, a worker performs operations on an order until the next worker downstream takes it over; then goes back to the previous worker upstream to take over a new order. We discuss distinct characteristics in order picking systems when bucket brigades are applied. We identify some efficiency losses under the BB picking and present a new BB picking protocol to improve the performance of order picking systems. The new BB picking is compared with the existing BB picking and zone picking through simulation experiments.     

Book review

Workload control (WLC) is a leading production planning and control (PPC) solution for small to medium sized enterprises (SMEs) and make-to-order (MTO) companies, but when WLC is implemented, practitioners find it difficult to determine suitable workload norms to obtain optimum performance. Theory has provided some solutions (e.g., based on linear programming) but, to remain optimal, these require the regular feedback of detailed information from the shop floor about the status of work-in-process (WIP), and are therefore often impractical. This paper seeks to predict workload norms without such feedback requirements, analysing the influence of shop floor characteristics on the workload norm. The shop parameters considered are flow characteristics (from an undirected pure job shop to a directed general flow shop), and the number of possible work centres in the routing of a job (i.e., the routing length). Using simulation and optimisation software, the workload norm resulting in optimum performance is determined for each work centre for two aggregate load-oriented WLC approaches: the classical and corrected load methods. Results suggest that the performance of the classical approach is heavily affected by shop floor characteristics but no direct relationship between the characteristics and norm to apply could be established. In contrast, results suggest that the performance of the corrected load approach is not influenced by shop floor characteristics and the workload norm which results in optimum performance is the same for all experiments. Given the changing nature of MTO production and the difficulties encountered with the classical approach, the corrected load approach is considered a better and more robust option for implementation in practice. Future simulations should investigate the influence of differing capacities across work centres on the workload norm while action research should be conducted to apply the findings in practice.     

Picklist generation algorithm with order-consolidation consideration for split-case module-based fulfilment centres

This paper serves as an initial study on order-consolidating time for a module-based order-picking system. In this system, items are stored in modules, and order picking is performed in waves that comprise more than one customer order. Picked items from multiple modules are conveyed to the packaging department for sortation based on customer orders. The order-consolidating time is the main focus as well as the performance measure in this paper. Order-consolidating time is the time difference between the arrival time of the first and the last item at the packaging department that belong to the same customer order. We proposed a heuristic control strategy, namely a pick-list generation algorithm, which will reduce the order-consolidating time. We named our proposed algorithm the push algorithm, which is an improvement algorithm. The push algorithm is compared with the basic algorithm to evaluate its performance. This comparison is extended under different environment settings to provide a robust conclusion. The experimental results indicate that the proposed algorithm consistently out-performs the basic algorithm in every tested environment with at least 17% improvement.     

Dynamic order batching in bucket brigade order picking systems with consecutive batch windows and non-identical pickers

The blocking mitigation mechanism contained in a batching and sequencing model improves order picking performance in bucket brigade order picking systems by adjusting the batch formation in a given batch window. The batch formation of a given batch window affects the transition to the next batch window and limits the batch formation’s structure in the next window. In addition, imbalance in picker capability increases the variation of batch formation while mitigating blocking delay. Our paper proposes a dynamic indexed batching model to smooth the transition between consecutive batch windows and give a better approximation of non-identical pickers’ capability. We develop a mixed integer programming solution for a dynamic indexed batching model in a bucket brigade order picking system (DIBMB). Simulation experiments show that the DIBMB smooths the transition between batch windows as measured in the delay experienced by the first batch in each batch window. Comparisons to the available batching models show that under DIBMB, the blocking delay gradually increases throughout the sequence of batches.     

Picking strategies to the two‐carousel‐single‐server system in an automated warehouse

Abstract

An automatic storage system comprised of two storage carousel conveyors and a retrieval apparatus integrated by computers has been considered in this paper. The order picking problem for such a two‐carousel‐single‐server system is presented here. The retrieval time is analyzed by a two‐stage solution procedure for the scheduling sequence of retrieving items from the system in order to satisfy an order requirement. The analytical results can be directly applied for the scheduling of the carousel storage system.