Define the objective function and the constraints to solve the following problem:

...

Suppose there are n jobs and m machines and each job must be processed on each machine. For each job, the machine order is fixed, that is, job j must first be processed on machine j(1) and then on machine j(2), and so on. A machine can only process one job at a time, and once a job is started on any machine it must be processed to completion. The objective is to minimize the sum of the completion times of all of the jobs. The data that specify an instance of the problem are m,n, and pij for j=1,,n and i=1,,m, which is the processing time of job j on machine i, and the machine order j(1),,j(m), for each job. Formulate the problem and solve the following instance: mn(pij)i=1,,4;j=1,,8=4=8=10694567674689108363461212291111324531 Table 1: Processing order of each job