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

Table 5

Thirty jobs and five nonidentical parallel machines’ scheduling [40].

Job	Machine					Job	Machine
	M1	M2	M3	M4	M5		M1	M2	M3	M4	M5
1	50	38	43	49	47	16	50	42	30	42	50
2	46	42	30	49	50	17	45	32	48	34	33
3	44	35	43	36	37	18	47	40	35	38	46
4	38	43	44	48	48	19	48	45	44	34	44
5	39	39	47	36	49	20	43	41	33	48	44
6	43	42	35	50	38	21	33	44	49	36	33
7	38	42	38	39	30	22	48	42	47	35	30
8	34	35	37	34	33	23	32	47	32	34	42
9	47	48	41	39	42	24	42	32	42	45	36
10	32	30	34	38	31	25	34	48	35	39	41
11	41	38	37	48	33	26	38	39	43	50	49
12	37	38	48	49	31	27	38	46	45	40	31
13	40	41	44	45	45	28	37	36	44	40	48
14	43	40	47	37	40	29	31	32	42	39	44
15	50	42	44	39	40	30	35	46	44	38	33