Branch-and-Bound algorithms are developed to optimally
schedule static single- and multi-stage job-shop productions. The 'corollary' of the study is to experimentally verify the effectiveness of
branch-and-bound algorithms to overcome the "curse of dimensionality" due to the combinatorial nature of job-shop scheduling problems.
The static scheduling problem contemplated in this dissertation...