Pages that link to "Item:Q5278230"
From MaRDI portal
The following pages link to Parallel variable neighborhood search for the min–max order batching problem (Q5278230):
Displaying 11 items.
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- Warehousing in the e-commerce era: a survey (Q1737474) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
- On solving the order processing in picking workstations (Q2070114) (← 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)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- Order batching problems: taxonomy and literature review (Q6087522) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← 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)