Finding all non-dominated points for a bi-objective generalized assignment problem

In this paper, we consider a bi-objective generalized assignment problem (BOGAP) and find all non-dominated points using two methods; Two Phases Method (TPM) and the Balanced Box Method (BBM). The computational results are shown by testing a number of instances, which indicates that the TPM performs better compared to the BBM.