An Optimal Algorithm for On-Line Palletizing at Delivery Industry

Authors:
Jochen Rethmann;Egon Wanke
Affiliations:
-;-
Venue:
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Year:
1998

Citing 4
Cited 0

Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Competivive Analysis of on-line Stack-Up Algorithms

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the combinatorial stack-up problem which is to process a given sequence q of bins by removing step by step bins from the first s positions of the sequence onto p stack-up places. We prove that the Most-Frequently algorithm has best worst-case performance of all on-line stack-up algorithms and is, additionally, the best polynomial time approximation algorithm for the stack-up problem known up to now, although it is a simple on-line algorithm.