In the branch and bound algorithm applied to minimize the makespan of the flow shop scheduling problem

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 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

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: