The makespan criterion for the BFSP is commonly used in the literature. This problem is also denoted as Fm/blocking/Cmax with the notation of Graham et al. [8] in the literature. Although Gilmore–Gomory's algorithm [9] can solve it optimally with two machine case (m = 2), it is ...