## 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.

Original language | English |
---|---|

Pages (from-to) | 508-531 |

Number of pages | 24 |

Journal | Journal of Combinatorial Optimization |

Volume | 36 |

Issue number | 2 |

DOIs | |

State | Published - 1 Aug 2018 |

### Bibliographical note

Publisher Copyright:© 2018, Springer Science+Business Media, LLC, part of Springer Nature.

## Keywords

- Analysis of algorithms
- Approximation algorithms
- Bin packing

## ASJC Scopus subject areas

- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics