### Abstract

A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, ie., the sum of the sizes of the bins. The Longest Processing Time-neuristic is applied to this NP-hard problem. For this approximation algorithm we prove a worst-case bound of 13/12 which is shown to be tight when the number of bins is even.

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

Pages (from-to) | 229-233 |

Number of pages | 5 |

Journal | Information Processing Letters |

Volume | 65 |

Issue number | 5 |

Publication status | Published - Mar 13 1998 |

### Fingerprint

### Keywords

- Approximation algorithms
- Bin packing
- Scheduling
- Worst-case performance

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Information Processing Letters*,

*65*(5), 229-233.

**A 13/12 approximation algorithm for bin packing with extendable bins.** / Dell'Olmo, Paolo; Kellerer, Hans; Speranza, Maria Grazia; Tuza, Z.

Research output: Contribution to journal › Article

*Information Processing Letters*, vol. 65, no. 5, pp. 229-233.

}

TY - JOUR

T1 - A 13/12 approximation algorithm for bin packing with extendable bins

AU - Dell'Olmo, Paolo

AU - Kellerer, Hans

AU - Speranza, Maria Grazia

AU - Tuza, Z.

PY - 1998/3/13

Y1 - 1998/3/13

N2 - A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, ie., the sum of the sizes of the bins. The Longest Processing Time-neuristic is applied to this NP-hard problem. For this approximation algorithm we prove a worst-case bound of 13/12 which is shown to be tight when the number of bins is even.

AB - A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, ie., the sum of the sizes of the bins. The Longest Processing Time-neuristic is applied to this NP-hard problem. For this approximation algorithm we prove a worst-case bound of 13/12 which is shown to be tight when the number of bins is even.

KW - Approximation algorithms

KW - Bin packing

KW - Scheduling

KW - Worst-case performance

UR - http://www.scopus.com/inward/record.url?scp=0001681545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001681545&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0001681545

VL - 65

SP - 229

EP - 233

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 5

ER -