The document discusses applying branch and bound technique to solve a 3-stage flow shop scheduling problem that includes transportation time between stages. [1] It presents an algorithm to find an optimal or near-optimal job sequence that minimizes total elapsed time. [2] A numerical example is provided and the optimal sequence of 5 jobs on 3 machines is determined as 3-1-4-5-2, with a total elapsed time of 115 units. [3] The technique provides decision makers an important tool for designing schedules for 3-stage flow shop problems including transportation times.