Competitive analysis of on-line stack-up algorithms

DOI10.1007/3-540-63397-9_31MaRDI QIDQ826113zbMATH OpenOpenAlexFDO

Authors Jochen Rethmann, Egon Wanke

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_31

zbMATH Keywords

online algorithmsstack-up problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Stack-up algorithms for palletizing at delivery industry
• On-line algorithms for controlling palletizers
• An approximation algorithm for the stack-up problem
• An approximation algorithm for stacking up bins from a conveyer onto pallets
• A practical approach for the FIFO stack-up problem

Cited in

(5)

• Stack-up algorithms for palletizing at delivery industry
• On-line algorithms for controlling palletizers
• On rearrangement of items stored in stacks
• An approximation algorithm for stacking up bins from a conveyer onto pallets
• An asymptotically optimal algorithm for online stacking

This page was built for publication: Competitive analysis of on-line stack-up algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826113)