Consider the processing data for a four job four machine makespan minimization f
ID: 371137 • Letter: C
Question
Consider the processing data for a four job four machine makespan minimization flow shop problem shown in the table below.
a) Among all possible permutation-type schedules, how many of them are enough to consider?(Hint: First , examine the processing times and determine the type offlow shop problem)
b)Generate all schedules asked in part (b),Do not try to draw their associated Gantt Charts,just list these sequences
c)Suppose that someone tells you that LPT sequences is the optimal permutation type schedule.Draw a Gantt chart for this schedule . Do you agree with him or not?Justify your answer
d)Now, Suppose thet the total completion time of the jobs is minimized . Determine the optimal schedule and show it on a Gantt Chartt
Job Machine 1 Machine 2 Mchine 3 Machine 4 1 15 18 20 24 2 12 14 15 18 3 6 8 9 11 4 10 12 13 17Explanation / Answer
A.
On solving:
Task A B C D 1 15.00 18.00 20.00 24.00 2 12.00 14.00 15.00 18.00 3 6.00 8.00 9.00 11.00 4 10.00 12.00 13.00 17.00 Dec Var A B C D 1 1 0 0 0 1 = 1 2 0 1 0 0 1 = 1 3 0 0 0 1 1 = 1 4 0 0 1 0 1 = 1 Only 1 task constraint 1 1 1 1 All Tasks covered <= <= <= <= 1 1 1 1 Total Time 53 Objective func MinRelated Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.