(Answered): Problem 3. (a) The following jobs are to be processed on a drill. Determine the sequence that minim ...

Problem 3. (a) The following jobs are to be processed on a drill. Determine the sequence that minimizes the mean flow time. | | | | | | Job Processing Time 2 6 3 9 4 8 5 5 6 3 7 6 12 (b) Use the Longest Processing Time rule for sequencing jobs. Compare the mean flow times of parts (a) and (b). Problem 4. A set of 10 jobs are to be processed on two machines, MA and MB. Each job must be processed on MA first, followed by MB. The processing times are as follows: | Job M A MB I | 1 5 4 2 8 6 3 10 3 4 8 4 5 3 5 6 6 2 7 6 8 8 3 6 9 8 5 10 2 6 1 Determine the optimal makespan schedule. What is the optimal makespan? Problem 5. The following processing times were obtained for an N-job, three-machine problem. Find the minimum makespan schedule. Job 1 3 Machine 1 Machine 2 Machine 3 10 1 7 12 13 10 8 5 9 9 2011 4 12 11 6 Determine the optimal makespan schedule. What is the optimal makespan?