Abstract
The Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP) is composed of two interacting sub- problems which are the mode assignment problem and the scheduling problem. Solving these sub-problems in isola- tion pose a challenge due to the interaction that exists be- tween them. We present a unified approach for applying a combination of algorithms to the sub-problems of the MR- CPSP. The use of Genetic algorithms and Estimation of Distribution Algorithms aims to exploit efficiently and syn- chronously the distinct search spaces presented by the two sub-problems.
Sign-in/Register to access full text options 
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.
