An evolutionary algorithm for the permutation flowshop scheduling problem with total tardiness criterion
by Tunchan Cura
International Journal of Operational Research (IJOR), Vol. 22, No. 3, 2015

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.

Online publication date: Wed, 11-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com