Minimum makespan scheduling problem : You are given $n$ jobs and $m$ identical machines. You are given processing times (say $t_i$) for the $n$ jobs. Your goal is to find an assignment of the $n$ jobs on these $m$ machines so as to minimize the completion time.
Algorithm : Sort the $n$ jobs by decreasing times. Schedule jobs in this order i.e., assign the next job to the machine that has least total work assigned to it.