Abstract
This paper investigates the multi-mode resource availability cost problem with recruitment and release dates for resources. This problem is a more realistic model and extended case of the resource availability cost problem. The project contains activities interrelated by finish–start precedence relations with zero time lags, which require a set of renewable resources. First, a mixed integer programming formulation is proposed for the problem. Then, simulated annealing (SA) algorithm is proposed to obtain a satisfying solution for this NP-hard problem. The effectiveness of the proposed algorithm is demonstrated through comprehensive experimentation based on 300 test problems. The results are analyzed and discussed.
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.
