“…Because the selected nodes are not necessarily the best at a given level of the tree, among the set of possible nodes of a pure branch-and-bound algorithm, a recovering phase is applied in the The RBS method has already been successfully used in the literature for solving scheduling problems [Della Croce et al, 2004], [Dong et al, 2009], [Rakrouki et al, 2012], [Valente, 2010], [Esteve et al, 2006], [Ghirardi and Potts, 2005]. In order to apply the RBS approach, it is necessary to specify its main…”