Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02501038
Contributor : Daniel Gavrysiak <>
Submitted on : Friday, March 6, 2020 - 2:52:29 PM
Last modification on : Thursday, June 4, 2020 - 10:12:04 AM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Ali Berrichi, Mohamed Mezghiche, Lionel Amodeo, Farouk Yalaoui. Pareto ant colony optimization based algorithm to solve maintenance and production scheduling problem in parallel machine case. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.1210-1215, ⟨10.1109/ICCIE.2009.5223778⟩. ⟨hal-02501038⟩

Share

Metrics

Record views

42