On solving the order processing in picking workstations
From MaRDI portal
Publication:2070114
DOI10.1007/s11590-020-01640-wzbMath1483.90082OpenAlexW3085364965MaRDI QIDQ2070114
Eduardo G. Pardo, Abdessamad Ouzidan, Alexandru-Liviu Olteanu, Abraham Duarte, Marc Sevaux
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01640-w
Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Hybrid variable neighborhood search for automated warehouse scheduling ⋮ A review of synchronization problems in parts-to-picker warehouses
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A new mathematical programming formulation for the single-picker routing problem
- Design and control of warehouse order picking: a literature review
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A survey of literature on automated storage and retrieval systems
- Variable neighborhood search
- Efficient order processing in an inverse order picking system
- Variable neighborhood search strategies for the order batching problem
- Parts-to-picker based order processing in a rack-moving mobile robots environment
- Variable neighborhood search: basics and variants
- Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data
- Tabu search heuristics for the order batching problem in manual order picking systems
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- General variable neighborhood search applied to the picking process in a warehouse
- Analysis and optimal design of discrete order picking technologies along a line
- Parallel variable neighborhood search for the min–max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
- Variable neighborhood search: Principles and applications
This page was built for publication: On solving the order processing in picking workstations