By analyzing the production features of the flexible job shop
a migrating birds optimization algorithm used variable neighborhood search(VNS_MBOA) was proposed by combining the migrating birds optimization and the variable neighborhood search algorithm to solve the production scheduling problem. A segment-based encoding approach is adopted
and a two-phase initialization of the population in the algorithm is performed to improve the quality of the initial solution. On the basis of the characteristics of the problem
two neighborhood structures are designed
based on which a variable neighborhood search algorithm is introduced to enhance the searching capability of VNS_MBOA effectively. Benchmark instances are adopted to test the proposed algorithm
and the simulation results are compared with other algorithms in literature. The computational data demonstrate that the proposed algorithm has certain degree effect for solving the flexible job shop scheduling problem.
关键词
Keywords
references
Kacem I, Hammadi S, Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic[J]. Mathematics and Computers in Simulation, 2002, 60(3): 245-276. DOI: 245
Brandimarte P. Routing and scheduling in a flexible job shop by tabu search[J]. Annals of Operations Research, 1993, 41(3): 157-183. DOI: 157
Demir Y, Īşleyen S K. An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations[J]. International Journal of Production Research, 2014, 52(13): 3905-3921. DOI: 3905
Ziaee M. A heuristic algorithm for solving flexible job shop scheduling problem[J]. The International Journal of Advanced Manufacturing Technology, 2014, 71(4): 519-528. DOI: 519
Duman E, Uysal M, Alkaya A F. Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem[J]. Information Sciences, 2012, 217(24): 65-77. DOI: 65
Kacem I, Hammadi S, Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[J]. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 2002, 32(1): 1-13. DOI: 1
Tongur V, Vlker E. Migrating birds optimization for flow shop sequencing problem[J]. Journal of Computer and Communications, 2014, 2(4): 142-147. DOI: 142
Chang H C, Tsai H T, Liu T K. Application of genetic algorithm to optimize unrelated parallel machines of flexible job-shop scheduling problem[C]//Proc of 11th IEEE International Conference on Control % Automation. USA: IEEE, 2014: 596-599.