By Topic

Applying Ant Colony Optimization 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
$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)
Benbouzid-Sitayeb, F. ; Lab. des Methodes de Conception de Syst. (LMCS), Nat. Inst. of Comput. Sci. (INI), Algiers ; Ammi, I. ; Varnier, C. ; Zerhouni, N.

In this paper a sequential resolution of the joint production and preventive maintenance scheduling problem in permutation flowshops is considered with the objective of minimizing the makespan. The proposed sequential algorithm, called SAS, consists of two steps: first the scheduling of the production jobs with Ant System algorithm (AS) by Dorigo and al. (1996) is considered. Then the insertion of the maintenance tasks is done according to several heuristics developed in previous works, taking the production scheduling as a strong constraint. Computational experiments are conducted on a large set of instances and the resulting joint ACO is presented.

Published in:

Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on

Date of Conference:

7-11 April 2008