Optimizing automated sorting in warehouses: the minimum order spread sequencing problem
From MaRDI portal
Publication:1754761
DOI10.1016/j.ejor.2018.03.026zbMath1403.90086OpenAlexW2799660113WikidataQ130057506 ScholiaQ130057506MaRDI QIDQ1754761
Stefan Fedtke, Nils Boysen, Felix Weidinger
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.03.026
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Evaluating the benefits of picking and packing planning integration in e-commerce warehouses ⋮ Optimal retrieval in puzzle‐based storage with heuristic search and tabulation ⋮ Automated sortation conveyors: a survey from an operational research perspective ⋮ Warehousing in the e-commerce era: a survey ⋮ The forgotten sons: warehousing systems for brick-and-mortar retail chains ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
Uses Software
Cites Work
- Unnamed Item
- A survey on single crane scheduling in automated storage/retrieval systems
- Research on warehouse operation: a comprehensive review
- Design and control of warehouse order picking: a literature review
- A survey of literature on automated storage and retrieval systems
- The impact of order batching and picking area zoning on order picking system performance
- Research on warehouse design and performance evaluation: a comprehensive review
- Scheduling shipments in closed-loop sortation conveyors
- Order picking along a crane-supplied pick face: the SKU switching problem
- Release Time Scheduling and Hub Location for Next-Day Delivery
- A Dynamic Programming Approach to Sequencing Problems
- Puzzle-based storage systems
This page was built for publication: Optimizing automated sorting in warehouses: the minimum order spread sequencing problem
