Write a branchandbound algorithm for the problem of scheduli

Write a branch-and-bound algorithm for the problem of scheduling with deadlines discussed in Section 4.3.2.

Solution

A brach and bound algorithm is proposed in such a way that lower bound is obtained from the preemptive schedules which forms solutions of single machine subproblems. In the branching rule, a set of operations which each require the same machine is selected and branched of the search tree corresponding to the possibilities than an operation of this set is sequenced before or after the others.

Branching method uses the branch rule to define the ordering of certain pairs of operations in a search tree and lower bound computation can be further tries to solve the given problem by defining the bounds...