Consider the following 4-job 5-machine makespan minimization flow shop scheduling problem in which all jobs are...

 

Transcribed Image Text:

Consider the following 4-job 5-machine makespan minimization flow shop scheduling problem in which all jobs are available at time zero, and the flow of jobs through the machines is Machine A, Machine B, Machine C, Machine D, and Machine E. Job 1 2 3 4 Machine A Machine B 30 23 25 18 21 13 18 10 Machine C 24 20 15 12 Machine D 25 23 18 13 (a) What is the number of all possible schedules? (b) What is the number of all possible permutation-type schedules? Machine E 22 16 12 8 (c) Apply the CDS algorithm to determine a permutation schedule. (d) Apply the Gupta's algorithm to determine a permutation schedule. (e) Compare the solutions obtained in (c) and (d). (f) Suppose that someone tells you that LPT sequence is the optimal permutation-type schedule. Draw a Gantt chart for this schedule. Do you agree with him or not? Justify your answer. Consider the following 4-job 5-machine makespan minimization flow shop scheduling problem in which all jobs are available at time zero, and the flow of jobs through the machines is Machine A, Machine B, Machine C, Machine D, and Machine E. Job 1 2 3 4 Machine A Machine B 30 23 25 18 21 13 18 10 Machine C 24 20 15 12 Machine D 25 23 18 13 (a) What is the number of all possible schedules? (b) What is the number of all possible permutation-type schedules? Machine E 22 16 12 8 (c) Apply the CDS algorithm to determine a permutation schedule. (d) Apply the Gupta's algorithm to determine a permutation schedule. (e) Compare the solutions obtained in (c) and (d). (f) Suppose that someone tells you that LPT sequence is the optimal permutation-type schedule. Draw a Gantt chart for this schedule. Do you agree with him or not? Justify your answer.

Answer rating: 100% (QA)

a To determine the number of all possible schedules we need to calculate the factorial of the number of jobs 4 since each job can be scheduled in any ... View the full answer