A particle swarm optimization approach for permutation flow shop scheduling problem | International Journal for Simulation and Multidisciplinary Design Optimization (IJSMDO)

Open Access

Table 2.

Makespan of 50 jobs, 5, 10 and 20 machines.

		Makespan
SL No.	Problem size	CDS	NEH	PSO	PSO-NEH	PSO-NEH-VNS	UB^*
1	50 × 5	2816	2733	2729	2729	2724	2724
2	50 × 5	3032	2843	2906	2843	2843	2834
3	50 × 5	2703	2640	2676	2621	2631	2621
4	50 × 5	2884	2782	2824	2782	2762	2751
5	50 × 5	3038	2868	2873	2864	2864	2863
6	50 × 10	3421	3135	3240	3134	3059	3025
7	50 × 10	3246	3032	3093	3025	2934	2892
8	50 × 10	3280	2986	3139	2965	2932	2864
9	50 × 10	3393	3198	3236	3172	3115	3064
10	50 × 10	3375	3160	3186	3115	3052	2986
11	50 × 20	4328	4082	4192	4061	4010	3875
12	50 × 20	4216	3921	4067	3918	3864	3715
13	50 × 20	4189	3927	3981	3907	3808	3668
14	50 × 20	4280	3969	4067	3957	3844	3752
15	50 × 20	4122	3835	3999	3832	3815	3635

Refers to upper bound of Taillard’s benchmark problems.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.