The computational experiment indicates that the sequences obtained using the stochastic
branch and bound algorithm have, on average, 5–7% shorter makespans than sequences
obtained using deterministic sequencing models. In addition, the proposed algorithm is
able to solve instances with 14 aircraft using less than 1 min of computation time.