Abstract

This article presents a new method based on multi- objective Pareto ant colony optimization to resolve the joint production and maintenance scheduling problem. This method is applied to the problem previously developed in [2] 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.