question answer

Q 1. Consider the following problem: There are two computers C, , C,, and a set of n programs, {P P ,..., P } to be run. Let T be the time required to run P . Assume that each computer can only run one program at a time. You are to assign the programs to the computers so that the time from the start of execution of the first program until the completion of the last program is minimized. Give a mathematical formulation of this problem that includes defining the binary decision variables, specifying the objective function and the constraints