 In this paper, we present an{\em asymptotic polynomial time approximation scheme (APTAS) for group bin packing, thus improving the best known ratio of 2 Adany et al., 2016%DIFDELCMD < ]%%% . In particular, for any instance I and a fixed \varepsilon \eps \in (0,1), our scheme packs the items in at most (1+ \varepsilon \eps )OPT(I) +1 bins, where OPT(I) is the minimum number of bins required for packing the instance {\em  {\em  {\em  .
<clarity>  In this paper, we present an{\em asymptotic polynomial time approximation scheme (APTAS) for group bin packing, thus improving the best known ratio of 2 Adany et al., 2016%DIFDELCMD < ]%%% . In particular, for any instance I and a fixed \varepsilon \eps \in (0,1), our scheme packs the items in at most (1+ \varepsilon \eps )OPT(I) +1 bins, where OPT(I) is the minimum number of bins required for packing the instance {\em  {\em  {\em  .
 In this paper, we present an{\em asymptotic polynomial time approximation scheme (APTAS) for the problem, improving upon the best known ratio of 2 Adany et al., 2016%DIFDELCMD < ]%%% . In particular, for any instance I and a fixed \varepsilon \eps \in (0,1), our scheme packs the items in at most (1+ \varepsilon \eps )OPT(I) +1 bins, where OPT(I) is the minimum number of bins required for packing the instance {\em {\em {\em .