Example 6.4.1 (Application of FFLL Algorithm). Consider a flexible flow shop with three stages. At stages 1 and 3 there are two machines in parallel. At stage 2, there is a single machine. There are five jobs in an MPS. Let p_(hj)^(') denote the processing time of job j at stage h,h=1,2,3. Jobs 1 2 3 4 5 p_(1j)^(') 6 3 1 3 5 p_(2j)^(') 3 2 1 3 2 p_(3j)^(') 4 5 6 3 4

Example 6.4.1 (Application of FFLL Algorithm). Consider a flexible flow shop with three stages. At stages 1 and 3 there are two machines in parallel. At stage 2, there is a single machine. There are five jobs in an MPS. Let phj denote the processing time of job j at stage h,h=1,2,3