摘要
This paper proposes a hybrid metaheuristic for the minimization of makespan in permutation flow shop scheduling problems. The solution approach is robust, fast. and simply structured, and comprises three components: an initial population generation method based on a greedy randomized constructive heuristic, a genetic algorithm (GA) for solution evolution, and a variable neighbourhood search (VNS) to improve the population. The hybridization of a GA with VNS, combining the advantages of these two individual components, is the key innovative aspect of the approach. Computational experiments on benchmark data sets demonstrate that the proposed hybrid metaheuristic reaches high-quality solutions in short computational times. Furthermore, it requires very few user-defined parameters. rendering it applicable to real-life flow shop scheduling problems.
学科与关键词
- An adaptive hybrid metaheuristic for permutation flowshop schedulingMoccellin, JV*; dos Santos, MOCONTROL AND CYBERNETICS, 2000, 29(3): 761-771.被引 3
- A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problemAhmadizar, Fardin*; Barzinpour, FarnazINTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2010, 3(6): 853-861.被引 10
- A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling ProblemsRobert, R. B. Jeen*; Rajkumar, R.Information Technology and Control, 2019, 48(1): 47-57.被引 6
