Pages that link to "Item:Q1761193"
From MaRDI portal
The following pages link to Algorithms for on-line order batching in an order picking warehouse (Q1761193):
Displaying 7 items.
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations (Q323430) (← links)
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem (Q1681522) (← links)
- General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review (Q1754199) (← links)
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses (Q1754220) (← links)
- GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
