Tighter bounds of the First Fit algorithm for the bin-packing problem

In this paper, we present improved bounds for the First Fit algorithm for the bin-packing problem. We prove CFF(L)≤1710C∗(L)+710 for all lists LL, and the absolute performance ratio of FFFF is at most 127.