Computer Science Suppose you are given n machines M1, . . . , Mn and n jobs J1, . . . , Jn. Each machine is designed to run a specific type of job faster than other jobs. Assume that machine M i can...

Suppose you are given n machines M1, . . . , Mn and n jobs J1, . . . , Jn.

Each machine is designed to run a specific type of job faster than other jobs. Assume that machine M_i can run job J_j in time t_ij. Design an integer linear program to find a one-to-one assignment of jobs to machines which minimizes the total running time.