By Topic

Genetic Local Search Algorithm for the Minimum Total Tardiness Permutation Flowshop Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Januario, T.O. ; Dept. de Informdtica, Univ. Fed. de Vicosa, Vicosa ; Arroyo, J.E.C. ; Moreira, M.C.O. ; Kampke, E.H.

This paper considers the permutation flowshop scheduling problem with blocking in-process with the objective of minimizing the total tardiness of jobs. In this problem there are no buffers between successive machines, that is, it is not allowed intermediate queues of jobs waiting in the system for their next operations. To solve the problem, we propose a genetic algorithm that includes strategies like local search, a procedure to control the diversity of the population and a procedure of intensification based on the path relinking technique. The path relinking technique generates news solutions transforming one elite solution to another one of the population. The performance of the proposed genetic algorithm is evaluated comparing with a constructive heuristic literature. Computational tests show that the algorithm is very efficient and promising.

Published in:

Computational Science and Engineering Workshops, 2008. CSEWORKSHOPS '08. 11th IEEE International Conference on

Date of Conference:

16-18 July 2008