Abstract
An online bin packing instance is a list of item sizes each of which is a rational number in (0,1], the goal is to partition the items into bins where the total size of items in a bin is at most 1, and the total number of bins is minimized. Here we analyze the ratio of two online algorithms for sequences where the total size of items is large and prove an old open conjecture of Johnson.
Original language | English |
---|---|
Pages (from-to) | 646-649 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 50 |
Issue number | 6 |
DOIs | |
State | Published - Nov 2022 |
Externally published | Yes |
Keywords
- Analysis of algorithms
- Bin packing
- Online algorithms
- Worst-case analysis
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics