Abstract
The multi-skill resource constrained project scheduling is an important and challenging problem in project management. Two key issues that turn this topic into a challenging problem are the assumptions that are considered to approximate the model to a real-world problem and exact solution approach for the model. In this paper, we deal with this two issues. To consider real-word situations, we take into account calendars specifying time intervals during which the resources are available. We proposed a constraint programming approach to solve the problem exactly. The problem with and without resource calendars are modeled with mathematical programming (MP) and constraint programming (CP). In addition, the performance of CP approach is evaluated by comparing Time-Indexed Model (TIM) and Branch and Price (B&P) approaches. Computational results show that the proposed approach can efficiently solve real-size instances.
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.
