Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling

Algorithm 2

TS algorithm template.

	Choose the initial solution using LPT rule s0
	Initialize memory structures
	Repeat
	Generate a set “A”of nontabu solutions
	Update memory structures
	Until stopping criterion true
	s0 is an approximate solution to the optimal solution