Abstract
In this note we combine two known algorithms and show how they can be used in order to generate tradeoff curves between time and cost for deterministic project scheduling problems with multiple modes and resource availability costs. The approach can handle linear and non-linear non-decreasing cost functions and it is based on the exact algorithm presented in Demeulemeester (1995) for the resource availability cost problem without multiple modes. As the problem is NP-hard, the method is computationally viable to solve only problems of a moderate size. The performance of the combined algorithm is compared to solutions generated by GAMS/CPLEX.
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.
