Pages that link to "Item:Q1926958"
From MaRDI portal
The following pages link to Tabu search heuristics for the order batching problem in manual order picking systems (Q1926958):
Displaying 29 items.
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
- A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
- An integrated model to improve ergonomic and economic performance in order picking by rotating pallets (Q1622803) (← links)
- Variable neighborhood search strategies for the order batching problem (Q1652118) (← links)
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem (Q1681522) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Utilizing individual picker skills to improve order batching in a warehouse (Q1694830) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- Warehousing in the e-commerce era: a survey (Q1737474) (← links)
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse (Q1740491) (← links)
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review (Q1754199) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- Order batching and batch sequencing in an AMR-assisted picker-to-parts system (Q2076924) (← links)
- An extensible multi-block layout warehouse routing optimization model (Q2083945) (← links)
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) (← links)
- Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm (Q2290119) (← links)
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing (Q2401327) (← links)
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- Order batching and order picking with 3D positioning of the articles: solution through a hybrid evolutionary algorithm (Q2686707) (← links)
- Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
- Picker Routing in AGV-Assisted Order Picking Systems (Q5084661) (← links)
- Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
- Order batching problems: taxonomy and literature review (Q6087522) (← links)
- Cost-neutral reduction of infection risk in picker-to-parts warehousing systems (Q6103187) (← links)
- Energy minimizing order picker forklift routing problem (Q6109806) (← links)
