Consider the following n jobs parallel identical machines problem.

Job —j 1 2 3 4 5 6 7 8 Processing time tf 4 6 3 7 2 1 5 9 Find the schedule which will minimize the mean flow time, if the number of parallel identical machines is 2.

AppendixLO1