Stack-up algorithms for palletizing at delivery industry

DOI10.1016/S0377-2217(99)00351-3zbMath0983.90016OpenAlexW2039712804MaRDI QIDQ1592737

Jochen Rethmann, Egon Wanke

Publication date: 25 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00351-3

zbMATH Keywords

complexitycontrolapproximationcompetitive analysison-line algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Directed Pathwidth and Palletizers ⋮ A Practical Approach for the FIFO Stack-Up Problem ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ Algorithms for Controlling Palletizers ⋮ On the complexity of the FIFO stack-up problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive analysis of on-line stack-up algorithms
• Online algorithms. The state of the art
• Storage controlled pile-up systems, theoretical foundations
• Performance approximation of pick-to-belt orderpicking systems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• An approximation algorithm for stacking up bins from a conveyer onto pallets
• Many birds with one stone

This page was built for publication: Stack-up algorithms for palletizing at delivery industry