Stack-up algorithms for palletizing at delivery industry
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 944424 (Why is no real title available?)
- An approximation algorithm for stacking up bins from a conveyer onto pallets
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Competitive analysis of on-line stack-up algorithms
- Many birds with one stone
- Online algorithms. The state of the art
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Performance approximation of pick-to-belt orderpicking systems
- Storage controlled pile-up systems, theoretical foundations
Cited in
(12)- Competitive analysis of on-line stack-up algorithms
- On the complexity of the FIFO stack-up problem
- Algorithms for controlling palletizers
- scientific article; zbMATH DE number 2241892 (Why is no real title available?)
- On rearrangement of items stored in stacks
- A practical approach for the FIFO stack-up problem
- On-line algorithms for controlling palletizers
- An approximation algorithm for stacking up bins from a conveyer onto pallets
- Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
- Analysis of heuristic solutions to the best choice problem.
- An asymptotically optimal algorithm for online stacking
- Directed pathwidth and palletizers
This page was built for publication: Stack-up algorithms for palletizing at delivery industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592737)