In this final lecture we will see some examples of real-life problems, how we can apply the techniques of the previous day to these examples in a way which enables us to find a good solution. We shall see a few examples where we can have either a combinatorial approach or a linear programming approach. Let's start with the job-shop scheduling. In the job-shop problem, we have jobs, machines and operations. Jobs consist of operations and each operation has to be processed by a machine with a definite processing time. Jobs have a prescribed deadline and the aim is at completing jobs within the deadlines and also as soon as possible. First we will show the combinatorial approach.