Solving the Job Shop Scheduling Problem Using the Imperialist Competitive Algorithm
2012 ◽
Vol 430-432
◽
pp. 737-740
◽
Keyword(s):
Job Shop
◽
This paper deals with the Job Shop Scheduling Problem with the minimization of makespan as the objective. A novel meta-heuristic named imperialist competitive algorithm (ICA) is adopted to solve the problem. Since appropriate design of the parameters has a significant impact on the performance of the algorithm, the parameters were chosen based on orthogonal test. A local search strategy based on critical path and critical block was used to improve the performance of the algorithm. At last the algorithm was tested on a set of standard benchmark instances, and the computational results showed that the algorithm proposed performed well in both convergence rate and better global optima achievement.
2019 ◽
Vol 13
(3)
◽
pp. 389-396
◽
2019 ◽
Vol 7
(1)
◽
pp. 13-18
◽
An improved bacterial foraging optimization for multi-objective flexible job-shop scheduling problem
2018 ◽
Vol 51
(4-6)
◽
pp. 323-332
◽