In the bin packing problem with conflicts, the aim is to pack items into the minimum number
of bins subject to incompatibility restrictions. Two lower bounding procedures and six
heuristics for this problem are developed and compared. SCOPE AND PURPOSE: Bin
packing problems occur in a number of industrial and transportation contexts where one
wishes to optimally assign jobs of different lengths to machines or load items into vehicles.
This paper proposes heuristics for a family of bin packing problems where some items are …

… In the bin packing problem with conflicts, the aim is to pack items into the minimum
number of bins subject to incompatibility restrictions. Two lower bounding procedures and
six heuristics for this problem are developed and compared. … Two lower bounding
procedures and six heuristics for this problem are developed and compared. …