Scheduling:

3.6. Solve by branch-and-bound the following instance of the 1 problem rj | Lmax jobs 1 2 3 4 5 6 7 pj 6 18 12 10 10 17 16 r 0 0 0 14 25 25 50 dj 8 42 44 24 90 85 68 3.6. Solve by branch-and-bound the following instance of the 1 problem rj | Lmax jobs 1 2 3 4 5 6 7 pj 6 18 12 10 10 17 16 r 0 0 0 14 25 25 50 dj 8 42 44 24 90 85 68