Abstract
We study min-sum bin packing (MSBP). This is a bin packing problem, where the cost of an item is the index of the bin into which it is packed. The problem is equivalent to a batch scheduling problem we define, where the total completion time is to be minimized. The problem is NP-hard in the strong sense. We show that it is not harder than this by designing a polynomial time approximation scheme for it. We also show that several natural algorithms which are based on well-known bin packing heuristics (such as First Fit Decreasing) fail to achieve an asymptotic finite approximation ratio, whereas Next Fit Increasing has an absolute approximation ratio of at most 2, and an asymptotic approximation ratio of at most 1.6188. We design a new heuristic that applies Next Fit Increasing on the relatively small items and adds the larger items using First Fit Decreasing, and show that its asymptotic approximation ratio is at most 1.5604.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Coffman E G, Garey M R, Johnson D S (1997) Approximation algorithms. In: Hochbaum D (ed) Approximation algorithms for bin packing: a survey. PWS Publishing Company, Boston
Csirik J, Woeginger GJ (1998) On-line packing and covering problems. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art, pp 147–177
Epstein L, Halldórsson MM, Levin A, Shachnai H (2009) Weighted sum coloring in batch scheduling of conflicting jobs. Algorithmica 55(4):643–665
Epstein L, Levin A (2007) Minimum weighted sum bin packing. In: Proceedings of the 5th international workshop on approximation and online algorithms (WAOA’2007), pp. 218–231
Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within +\varepsilon $ in linear time. Combinatorica 1:349–355
Feige U, Lovász L, Tetali P (2004) Approximating min sum set cover. Algorithmica 40(4):219–234
Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256–278
Lovàsz L (1975) On the ratio of optimal integral and fractional covers. Discrete Math 13:383–390
Munagala K, Babu S, Motwani R, Widom J (2005) The pipelined set cover problem. In: Proceedings of the 10th international conference on database theory (ICDT’2005), pp 83–98
Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3(1–2):59–66
Ullman JD (1971) The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton
Author information
Authors and Affiliations
Corresponding author
Additional information
D. S. Johnson: Deceased, March 8th, 2016.
Rights and permissions
About this article
Cite this article
Epstein, L., Johnson, D.S. & Levin, A. Min-Sum Bin Packing. J Comb Optim 36, 508–531 (2018). https://doi.org/10.1007/s10878-018-0310-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0310-x