Pages that link to "Item:Q1695017"

The following pages link to General variable neighborhood search for the order batching and sequencing problem (Q1695017):

Displaying 16 items.

• 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)
• General variable neighborhood search for the data mule scheduling problem (Q1791917) (← 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)
• Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
• General variable neighborhood search applied to the picking process in a warehouse (Q2631231) (← links)
• Spatial and temporal optimization for smart warehouses with fast turnover (Q2664446) (← links)
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
• (Q4475662) (← links)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
• Order batching problems: taxonomy and literature review (Q6087522) (← links)
• Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context (Q6559404) (← links)
• The pollution traveling salesman problem with refueling (Q6568477) (← links)
• Managing cutoff-based shipment promises for order fulfilment processes in warehousing (Q6581377) (← links)