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

Table 1

Nine jobs and four nonidentical parallel machines’ scheduling [5].

Job	Machine
	M1	M2	M3	M4
Job 1	18	9	4.5	3.6
Job 2	14	7	3.5	2.8
Job 3	24	12	6	4.8
Job 4	30	15	7.5	6
Job 5	16	8	4	3.2
Job 6	20	10	5	4
Job 7	22	11	5.5	4.4
Job 8	26	13	6.5	5.2
Job 9	14	7	3.5	2.8