Pages that link to "Item:Q1761193"

The following pages link to Algorithms for on-line order batching in an order picking warehouse (Q1761193):

Displaying 16 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)
• 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)
• A computational software system to design order picking warehouses (Q2668754) (← links)
• EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING (Q2788859) (← links)
• Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
• SKU arrangement on a unidirectional picking line (Q6066285) (← 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)
• A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints (Q6195023) (← links)