On scheduling with earliest starts and due dates on a group of identical machines

This paper examines the (n, m) scheduling problem with n operations distributed among m machines. An algorithm for solving this problem is presented and, gives a good heuristic solution on a wide class of problems. Computational results are reported which demonstrate the efficiency of this approach.