Pages that link to "Item:Q1652118"
From MaRDI portal
The following pages link to Variable neighborhood search strategies for the order batching problem (Q1652118):
Displaying 14 items.
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← 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)
- An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm (Q2290119) (← links)
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
- Storage assignment and order batching problem in Kiva mobile fulfilment system (Q5058813) (← links)
- Hybrid variable neighborhood search for automated warehouse scheduling (Q6063514) (← links)
- Order batching problems: taxonomy and literature review (Q6087522) (← links)
- The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store (Q6092600) (← links)
