Hybrid variable neighborhood search for automated warehouse scheduling
From MaRDI portal
Publication:6063514
DOI10.1007/s11590-022-01921-6MaRDI QIDQ6063514
Tong Xialiang, Yury A. Kochetov, Daniil Tolstykh, Ivan Davydov, Liu Jiawen
Publication date: 7 November 2023
Published in: Optimization Letters (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Design and control of warehouse order picking: a literature review
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- A survey of literature on automated storage and retrieval systems
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Variable neighborhood search strategies for the order batching problem
- Variable neighborhood search: basics and variants
- Warehousing in the e-commerce era: a survey
- On solving the order processing in picking workstations
- The hybrid flow shop scheduling problem
- Flowshop sequencing problems with limited buffer storage
- A computational study of heuristics for two-stage flexible flowshops
- A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage
- The variable neighborhood search for the two machine flow shop problem with a passive prefetch
This page was built for publication: Hybrid variable neighborhood search for automated warehouse scheduling