Question: In the branch and bound algorithm applied to minimize the makespan of the flow shop scheduling problem with m machines and n jobs, the lower
In the branch and bound algorithm applied to minimize the makespan of the flow shop scheduling problem with m machines and n jobs, the lower bound computed w.r.t. to the machine m is given by the formula
(a) bm = Latest completion time on machine m among the assigned jobs + amount of processing yet required on machine m.
(b) bm = Latest completion time on machine m among the assigned jobs — amount of processing yet required on machine m.
(c) b,,, = Latest completion time on machine m among the assigned jobs + amount of processing yet required on machine 1.
(d) None of the above AppendixLO1
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
