JUST NEED OPTION

no need explain

NO need for explanation

i will rate you

Question 9 Not yet answered Marked out of 1.00 Flag question 5 Consider the following single machine-scheduling problem with weights: Job(J) 1 2 3 4 5 Processing 154 5 148 time (tj) Weight (w) 3 2 2 1 2 Determine the sequence, which will minimize the weighted mean flow time of the above problem. The optimum sequence is: Select one: 2-5-3-1-4 O2-3-1-5-4 O 2-1-5-3-4 O 2-3-5-1-4