In this work, we study the Square Min-Sum Bin Packing Problem (SMSBPP), where a list of n square items has to be packed into square bins of dimensions \(1 \times 1\) with no overlap between the areas of the items. The bins are indexed (starting at one) and the cost of packing each item is equal to the index of the bin in which it is placed. The objective is to minimize the total cost of packing all items, which is equivalent to minimizing the average cost of items. The problem has applications in minimizing the average time of logistic operations such as cutting stock and delivery of products. We prove that classic algorithms for two-dimensional bin packing that order items in non-increasing order of size, such as Next Fit Decreasing Height or Any Fit Decreasing Height heuristics, can have an arbitrarily bad performance for SMSBPP. We, then, present an algorithm with an approximation ratio of \(\sqrt{205}-12+\delta \) ( \(\approx 2.3178+\delta \) ), for any \(\delta > 0\) , and running time \(O(n \log n)\) . Finally, we also present a PTAS for the problem.
