Next-fit-decreasing (NFD) is an algorithm for bin packing.
Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity.
The NFD algorithm uses the following heuristic: In short: NFD orders the items by descending size, and then calls next-fit bin packing.
Baker and Coffman[1] proved that, for every integer r, when the size of all items is at most 1/r, the asymptotic approximation ratio of RFD satisfies
[2] Next-Fit packs a list and its inverse into the same number of bins.
[3] However, Next-Fit-Increasing performs better when there are general cost structures.