Minimizing Makespan on Identical Parallel Machines

A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructedby using the current solution is developed to solve a classical multiprocessor scheduling problem withthe objective of minimizing the makespan. Computational results indicate that the proposed algorithm is verycompetitive with respect to well-known constructive algorithms for a large number of benchmark instances.