***PLEASE SOLVE WITHOUT EXCEL. JUST HAND WRITING***

_{****Please show all steps clearly. If you cannot solve it please don't write anything PLEASE.****}

******PLEASE DO NOT COPY PASTE FROM OTHER SOLUTIONS. THESE ARE NOT CLEAR FOR ME.*****

***PLEASE SOLVE WITHOUT EXCEL. JUST HAND WRITING***

_{****Please show all steps clearly. If you cannot solve it please don't write anything PLEASE.****}

******PLEASE DO NOT COPY PASTE FROM OTHER SOLUTIONS. THESE ARE NOT CLEAR FOR ME.*****

PROBLEM-5) (10 Pts) Consider the following job times for a three-machine problem. Assume that the jobs are processed in the sequence A-B-C. A B C JOB J1 15 12 12 J2 20 9 13 J3 12 10 10 J4 14 8 17 J5 18 11 14 a. Find the optimal sequencing of the jobs in order to minimize the makespan. What is the makespan at the optimal solution? (6 Pts.) b. Draw a Gantt chart illustrating your solution. (4 Pts.)