Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

  • Authors:

  • G. I. Zobolas;C. D. Tarantilis;G. Ioannou

  • Affiliations:

  • Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Evelpidon 47A and Leukados 33, 11369 Athens, Greece;Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Evelpidon 47A and Leukados 33, 11369 Athens, Greece;Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Evelpidon 47A and Leukados 33, 11369 Athens, Greece

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.