This paper surveys methods proposed in the literature for determining the optimal solution to "N Job, M Machines" scheduling problems when there are no due dates or priorities and the sole objective is to complete all operations in least time.