An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given

Abstract

In this article, an analog of previously proposed algorithm Limited Hash Packing for Multiple Strip Packing Problem is studied using probabilistic analysis. Limited Hash Packing is an on-line algorithm, which works in closed-end mode, knowing the number of rectangles it has to pack before knowing the heights and width of the first rectangle.

Keywords

• strip packing
• multiple strip packing
• онлайновый алгоритм
• режим closed-end
• вероятностный анализ
• алгоритм упаковки прямоугольников в ограниченные области
• limited hash packing