Pages that link to "Item:Q319040"
From MaRDI portal
The following pages link to MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040):
Displaying 13 items.
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- A matheuristic approach for the design of multiproduct batch plants with parallel production lines (Q1631517) (← 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)
- 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)
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices (Q2171595) (← 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)
- Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
- Order batching problems: taxonomy and literature review (Q6087522) (← links)
