By Topic

An integrated ACO approach for the joint production and preventive maintenance scheduling problem in the flowshop sequencing 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
$33 $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)
Fatima Benbouzid-Sitayeb ; Laboratoire des Méthodes de Conception de Systèmes (LMCS). BP 68M Oued Smar 16270 Algiers (Algeria) ; Ismail Ammi ; Christophe Varnier ; Noureddine Zerhouni

In this paper, an integrated ACO approach to solve joint production and preventive maintenance scheduling problem in permutation flowshops is considered. A newly developed ant-colony algorithm is proposed and analyzed for solving this problem, based on a common representation of production and maintenance data, to obtain a joint schedule that is, subsequently, improved by a new local search procedure. The goal is to optimize a common objective function which takes into account both maintenance and production criteria. We compare the results obtained with our algorithm to those of an integrated genetic algorithm developed in previous works. The results and experiments carried out indicate that the proposed ant-colony algorithm provide very effective solutions for this problem.

Published in:

2008 IEEE International Symposium on Industrial Electronics

Date of Conference:

June 30 2008-July 2 2008