Algorithms for on-line order batching in an order picking warehouse
From MaRDI portal
Publication:1761193
DOI10.1016/j.cor.2011.12.019zbMath1251.90007MaRDI QIDQ1761193
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.019
90B35: Deterministic scheduling theory in operations research
90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming
Related Items
Parallel variable neighborhood search for the min–max order batching problem, MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem, Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations, A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem, General variable neighborhood search for the order batching and sequencing problem, Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review, An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses, GRASP with variable neighborhood descent for the online order batching problem, Order batching using an approximation for the distance travelled by pickers, On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm, A computational software system to design order picking warehouses, EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING
Cites Work
- Unnamed Item
- Unnamed Item
- Design and control of warehouse order picking: a literature review
- The impact of order batching and picking area zoning on order picking system performance
- Online algorithms. The state of the art
- On-line scheduling algorithms for a batch machine with finite capacity
- Travel time analysis for general item location assignment in a rectangular warehouse
- Travel time estimation and order batching in a 2-block warehouse
- On-line algorithms for minimizing makespan on batch processing machines
- Order batching in walk-and-pick order picking systems
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Routing policies and COI-based storage policies in picker-to-part systems
- Efficient orderbatching methods in warehouses
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Joint order batching and order picking in warehouse operations
- Online Single Machine Batch Scheduling
- Approximation and Online Algorithms
- On-line single-server dial-a-ride problems
