In this paper, we present a new multi-criteria assignment problem that groups characteristics from the well known Bin Packing Problem (BPP) and Generalized Assignment Problem (GAP). Similarities and differences between these problems are discussed, and a new variant of BPP is presented. The new variant will be called generalized assignment problem with identified *rst-use bins (GAPIFB). An algorithm based on the resolution method used for GAP problem and on GAPIFB is proposed to solve the new assignment problem.
