Solving the Periodic Maintenance Scheduling Problem via Genetic Algorithm to Balance Workforce Levels and Maintenance Cost
Mohamed Ali Abdel-Fattah Mansour
DOI : 10.3844/ajeassp.2011.223.234
American Journal of Engineering and Applied Sciences
Volume 4, Issue 2
Problem statement: In this article we address the multi-objective Periodic Maintenance Scheduling Problem (PMSP) of scheduling a set of cyclic maintenance operations for a given set of machines through a specified planning period to minimize the total variance of workforce levels measured in man-hours and maintenance costs with equal weights. Approach: The article proposed a mixed integer non-linear math programming model and a linearised model for the PMSP. Also, we proposed a Genetic Algorithm (GA) for solving the problem using a new genome representation considered as a new addition to the maintenance scheduling literature. The algorithms were compared on a set of representative test problems. Results: The developed GA proves its capability and superiority to find good solutions for the PMSP and outperforms solutions found by the commercial optimization package CPLEX. The results indicated that the developed algorithms were able to identify optimal solutions for small size problems up to 5 machines and 6 planning periods.The GAs defined solutions in 22 seconds consuming less than two kilobytes with a reliability of 0.84 while the nonlinear and linear models consumes on average 705 and 37 kilobytes respectively. Conclusion: The developed GA could define solutions of average performance of 0.34 and 0.8 for the linearized algorithm compared with lower bound defined by the nonlinear math programming model. We hope to expand the developed algorithms for integrating maintenance planning and aggregate production planning problems.
© 2011 Mohamed Ali Abdel-Fattah Mansour. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.