A composite algorithm for multiprocessor scheduling

A composite algorithm is developed for the classical problem of scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. The algorithm at first obtains a family of initial partial solutions and combines these partial solutions until a feasible solution is generated. Then local search procedures are used for improving the solution. The effectiveness of this approach is evaluated through extensive computational comparisons with recent improvement heuristics for different classes of benchmark instances.