Suppose that there are m machines and n jobs. Each job j has a processing time pij on machine i. A scheduling for them partitions the n jobs into m sequences J1, J2,., Jm, and assigns Ji (possibly empty) to the machine i for l <= i <= m. If a job j appears as the k-th job in Ji, it would finish at time which is the sum of the processing time of the first k jobs in Ji. Give a polynomial-time algorithm to compute a scheduling which minimizes the total finishing times of all jobs