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

Tunchan Cura

International Journal of Operational Research, 2015, vol. 22, issue 3, 366-384

Abstract: 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.

Keywords: evolutionary algorithms; flow shop scheduling; total tardiness; heuristics; permutation flow shops. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=68287 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:22:y:2015:i:3:p:366-384

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().