The generalized assignment problem with minimum quantities

► We introduce a variant of the GAP including minimum quantities. ► We provide complexity and approximation results on different variants of the problem. ► Polynomial time (1, 2)-approximation algorithm for the general problem with fixed number of bins. ► Computational results indicate that the (1, 2)-approximation algorithm outputs good solutions in practice.