VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Facultad de Ciencuas Exactas y naturals, Universided de Buenos Aires, December ,2008

a_shraideh's picture
Research Title: 
New Generalized Assignment Problem with Identified First-Used Bin
Authors: 
Ahmad AlShraydeh
Country: 
Argentina
Date: 
Mon, 2008-12-01
AttachmentSize
New generalized assignment problem with identified first-use bins.pdf126.93 KB
Research Abstract: 

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.