Consider the concept of "shortest job first" (SJF) scheduling and how it relates to minimizing average completion time.

Prove that any non-SJF schedule can be transformed into an SJF schedule without increasing the average completion time by swapping adjacent jobs.

Use an exchange argument to show that if a schedule is not SJF, there exists a pair of jobs where swapping them reduces the average completion time, contradicting optimality.