Parallel Branch and Bound Algorithms for the Two-machine Flow Shop Problem with Limited Machine Availability