Jochen Rethmann, Hochschule Niederrhein, FB Elektrotechnik und Informatik, Reinarzstraße 49, 47805 Krefeld
An optimal algorithm for on-line palletizing at delivery industry
ISAAC 1998 (LNCS 1533, pp. 109-118)
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. |