Abstract
This paper addresses a multi-skill resource-constrained multi-project scheduling problem (MSRCMPSP) with different types of resources and complex industrial constraints, which originates from SNCF heavy maintenance factories. Two objective functions, that have been rarely addressed in the literature, are independently considered: (i) Minimization of the sum of the weighted tardiness of the projects and (ii) Minimization of the sum of the weighted duration of the projects. A time-indexed mixed-integer linear programming model is presented with both resource assignment and capacity constraints. To solve large instances with several thousand activities, a new memetic algorithm combining a novel hybrid simulated genetic algorithm with a simulated annealing is implemented. The memetic algorithm is compared with popular solution approaches. Computational experiments conducted on real instances and benchmark instances validate the efficiency of the proposed algorithm.
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 callDisclaimer: 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.
