Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
From MaRDI portal
Publication:2669653
DOI10.1016/j.cor.2021.105556OpenAlexW3201173154MaRDI QIDQ2669653
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105556
makespan minimizationorder pickingorder batchingbi-objective MILPmixed-shelves storage strategymultiple pickers' routing
Related Items (3)
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Order batching problems: taxonomy and literature review ⋮ Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances
Cites Work
- An algorithm for dynamic order-picking in warehouse operations
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Approximation algorithms for scheduling unrelated parallel machines
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- Using a TSP heuristic for routing order pickers in warehouses
- A model for warehouse order picking
- Multicriteria optimization
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- Picker routing in rectangular mixed shelves warehouses
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Optimally solving the joint order batching and picker routing problem
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- General variable neighborhood search for the order batching and sequencing problem
- Warehousing in the e-commerce era: a survey
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Throughput analysis for order picking system with multiple pickers and Aisle congestion considerations
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- GRASP with variable neighborhood descent for the online order batching problem
- An efficient and general approach for the joint order batching and picker routing problem
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- The storage location assignment and interleaving problem in an automated storage/retrieval system with shared storage
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Routing methods for warehouses with multiple cross aisles
- Least squares quantization in PCM
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Wave order picking under the mixed-shelves storage strategy: a solution method and advantages