Revisiting branch and bound search strategies for machine scheduling problems