A comparison of heuristics for the problem of batching orders for warehouse selection
From MaRDI portal
Publication:4230089
DOI10.1080/00207549608904926zbMath0926.90007OpenAlexW2021782634MaRDI QIDQ4230089
Publication date: 1 March 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549608904926
Related Items (17)
Research on warehouse operation: a comprehensive review ⋮ Variable neighborhood search strategies for the order batching problem ⋮ A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ Order batching problems: taxonomy and literature review ⋮ Travel time estimation and order batching in a 2-block warehouse ⋮ Order batching in walk-and-pick order picking systems ⋮ Exact and inexact solution procedures for the order picking in an automated carousal conveyor ⋮ An evaluation of routing policies for order-picking operations in low-level picker-to-part system ⋮ GRASP with variable neighborhood descent for the online order batching problem ⋮ Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time ⋮ Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system ⋮ Joint order batching and order picking in warehouse operations ⋮ The impact of order batching and picking area zoning on order picking system performance ⋮ A study on order-batching methods of order-picking in a distribution centre with two cross-aisles ⋮ Warehouse design and control: Framework and literature review ⋮ VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
Cites Work
This page was built for publication: A comparison of heuristics for the problem of batching orders for warehouse selection
