1. 1 Exercise 1. (a) Find all optimal sequences for the scheduling problem 1 ||  w j C j with the following jobs. (b) Determine the effect of a change in p 2 from 6 to 7 on the optimal sequence.

2. 2 Exercise 2. Find the optimal sequence for the scheduling problem 1 | | h max with the following jobs. Calculate h max for the obtained optimal schedule.

3. 3 Exercise 3. Solve by branch-and-bound the scheduling problem 1 | r j | L max with the following jobs:

4. 4 Exercise 4. Consider six jobs having processing times and due-dates given in the table: Find the optimal sequence for the scheduling problem 1 ||  U j.

5. 5 Exercise 5. Find the optimal sequence for the scheduling problem 1 | S jk | C max where the sequence-dependent setup times have the form s jk = | a k - b j |. The parameters are given in the table: