Stack-up algorithms for palletizing at delivery industry
type: Item
instance of: scholarly article
title: Stack-up algorithms for palletizing at delivery industry
zbMATH Open document ID: 0983.90016
DOI: 10.1016/S0377-2217(99)00351-3
published in: European Journal of Operational Research
publication date: 2001-01-25T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1556524
zbMATH Keywords: on-line algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: complexity
zbMATH Keywords: approximation
zbMATH Keywords: control
author: Jochen Rethmann
author: Egon Wanke
MaRDI profile type: Publication
cites work: Q4223058
cites work: Performance approximation of pick-to-belt orderpicking systems
cites work: Online algorithms. The state of the art
cites work: Q4198056
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Many birds with one stone
cites work: An approximation algorithm for stacking up bins from a conveyer onto pallets
cites work: Competitive analysis of on-line stack-up algorithms
cites work: Storage controlled pile-up systems, theoretical foundations
cites work: Q4715388
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
full work available at URL: s0377-2217(99)00351-3
OpenAlex ID: W2039712804
description: scientific article; zbMATH DE number 1556524