For the well-known simple assembly line balancing problem (SALBP-1), we propose a special case for which there is no Branch and Bound algorithm with polynomial Lower Bound which can solve instances even for n = 60 operations in appropriate time. Additionally, a SALPB-1 problem with opposite optimization criterion, namely, maximization of stations used, is considered.