Computer Algorithm

Q1-a: N jobs are to be processed. Two machines
A and B are available. If job i is processed on machine A then ai units of
processing time are needed. If it is processed on machine B then bi units of
processing time are needed. It is quite possible that ai bi for some i and
aj > bj for some j, i = j.
Explain the following dynamic programming formulation in your own
words, specially clarify all the terms below
Ki = {(TA + ai, TB, S {i}), (TA, TB + bi, S) | (TA,TB,S) Ki1}.

Question 1 (b): Use the dynamic programming solution described
above to solve the following instance of the problem: n = 3, (a1, a2,
a3) = (4, 6, 7) and (b1, b2, b3) = (2, 3, 4).
Assume that no purging rules are available. Clearly identify the final
solution.
PLACE THIS ORDER OR A SIMILAR ORDER WITH US TODAY AND GET AN AMAZING DISCOUNT 🙂