Method
First-Fit Decreasing
Sort items largest-first, then place each in the first fitting bin.
Also called: First-Fit Decreasing · FFD · 퍼스트핏 감소
Last verified: 2026-05-27
A bin packing heuristic that sorts items by decreasing size, then places each item into the first open bin it fits (opening a new bin if none fit). Known for classic approximation-ratio analysis, and used as a starting point for 2D/orthogonal variants.
Claims & evidence
Every relationship is a claim with an equivalence level and an evidence grade. See the evidence policy.
| Relationship | Claim | Equiv. | Evidence | Sources |
|---|---|---|---|---|
| shares method withBottom-Left Fill | First-fit-decreasing and bottom-left-fill are both constructive placement heuristics that place items one by one under a fixed rule. | E3 | B |
|
Neighborhood
Direct graph neighbors. Toggle depth to expand.
Click a node to open it · click an edge for its claim
See also
Not directly linked, but conceptually close — by the connections and descriptions they share.
- 2D Irregular NestingFormal problem3 connections in common
- Genetic AlgorithmMethod2 connections in common
- Guillotine CuttingFormal problem2 connections in common
- Tabu SearchMethod2 connections in common
- Integer Linear ProgrammingMethod2 connections in common
- 2D KnapsackFormal problem2 connections in common