Consider the minimum average completion time (MACT) of the scheduling problem given in the lectures notes. Suppose that the number jobs is n and the number of servers is r. The jobs are sorted according to their execution time. Prove that the cycling of jobs through the processors, as described in the lecture, gives the optimal solution to the MACT problem.

Lecture notes can be found here: https://www.dropbox.com/s/3l7e4zfmiayj6on/Chapter%201%20Exhaustive%20Search.2017.pdf?dl=0