An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion

CURA T.

International Journal of Operational Research, cilt.22, sa.3, ss.366-384, 2015 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 22 Sayı: 3
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1504/ijor.2015.068287
  • Dergi Adı: International Journal of Operational Research
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.366-384
  • Anahtar Kelimeler: Evolutionary algorithms, Flowshop scheduling, Heuristics, Total tardiness
  • İstanbul Üniversitesi Adresli: Evet

Özet

Copyright © 2015 Inderscience Enterprises Ltd.The permutation flowshop scheduling problem (PFSP) has been studied by many researchers. It has been addressed using various approaches, including branch and bound, tabu search, simulated annealing and genetic algorithms. This study presents a new evolutionary algorithm approach to the PFSP with a total tardiness criterion that is not only easy to tune and quite simple but also effective. The algorithm includes additional techniques, such as a mating procedure specifically designed for the problem, a local search with two different neighbourhood sizes, and a revision procedure. The algorithm was tested against 540 benchmark problems that have already been used to test the state-of-the-art approaches. The results show that our algorithm's effectiveness increases as the problem size grows.