Given 10 jobs to be processed on two machines Machine 1 and

Given 10 jobs to be processed on two machines (Machine 1 and Machine 2), the processing times are shown in Table 1. What is the optimum sequence that minimizes the makespan of the jobs? What is the waiting time for processing?

Solution

time taken for the assigned is considered and the minimum tim eis of any machine iis taken as the first job and subsequently all the jobs are considere and we get a table as follows

jobs machine 1 machine 2

time in time out time in time out

J3 0 9 9 22

J2 9 26 22 32

J6 26 38 32 42

J1 38 53 42 53

J4 53 65 53 68

J7 65 77 68 82

J8 77 90 82 97

J5 90 104 97 111

J9 104 119 111 125

\\

Total elapsed time from Job1 to end is 125 hours

Machine 1 is idle for 125-119 = 6 hours

Machine 2 is idle for 9 hours.