The problem of scheduling n jobs on a single machine so as to minimize the coefficinet of variation of the job completion times is considered in this paper. Some results on the characterization of an optimal schedule including its V-shape are proved. Explicit optimal schedules for some small values of n are also given. A heuristic method for solving the problem is proposed and its efficiency is investigated.
