Question: Solve the following problems: Problem 1: consider the following single machine scheduling problem 2 4 5 6 8 Job (1) Processing time t; (hrs) 1

Solve the following problems: Problem 1: consider

Solve the following problems: Problem 1: consider the following single machine scheduling problem 2 4 5 6 8 Job (1) Processing time t; (hrs) 1 13 3 5 7 18 4 14 8 6 16 Find the optimal sequence which will minimize the mean flow time and also obtain the minimum mean flow time. Problem2: Consider the following single machine scheduling problem with weights 1 2 3 4 5 6 8 Job () Processing time t; (hrs) Weights Wi 13 5 8 9 4 2 14 2 7 16 1 15 2 1 1 3 3 Determine the sequence which will minimize the weighted mean flow time of the above problem. Also find the weighted mean flow time Problem 3: Consider the following single machine scheduling problem 1 2 3 4 5 6 8 Job (i) Processing time t; (hrs) Due date di 7 10 10 8 8 12 15 7 11 17 24 15 10 12 18 25 16 Determine the sequence which will minimize the maximum lateness Lj. Also determine the lateness with respect to the optimal sequence

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!