Article ID: | iaor1992539 |
Country: | Germany |
Volume: | 27 |
Start Page Number: | 263 |
End Page Number: | 271 |
Publication Date: | Aug 1991 |
Journal: | Elektronische Informationsverarbeitung und Kybernetik |
Authors: | Scheithauer G. |
Keywords: | production |
In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally a hard example gives a lower bound of the performance bound.