By Topic

Pareto ant colony optimization based algorithm to solve maintenance and production scheduling problem in parallel machine case

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)
Berrichi, A. ; Lifab, Univ. of M''hamed Bouguerra of Boumerdes, Boumerdes, Algeria ; Mezghiche, M. ; Amodeo, L. ; Yalaoui, F.

This article presents a new method based on multiobjective Pareto ant colony optimization to resolve the joint production and maintenance scheduling problem. This method is applied to the problem previously developed in for the parallel machines case. This problem was formulated according to a bi-objective approach to find trade-off solutions between both objectives of production and maintenance. Reliability models were used to take into account the maintenance aspect in the model. Two genetic algorithms were compared to approximate the Pareto front. Here, we propose a new algorithm based on Pareto ant colony optimization to improve the solutions quality found in the previous study. The goal is to simultaneously determine the best assignment of production tasks to machines by minimizing the makespan as well as the best periods of preventive maintenance (PM) of the machines by minimizing the unavailability of the production system. The experiments carried out show an improvement of the previous results.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009