Abstract
In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing a special type of precedence constraints called “Feeding Precedences” (FP). To the best of our knowledge no exact algorithm exists for this problem. Exploiting the lower bound and the mathematical formulation proposed in Bianco and Caramia (4OR 9(4):371–389 2011) for the RCPSP with FP, in this paper we propose an exact algorithm based on branch and bound rules. A computational experimentation on randomly generated instances and a comparison with the results achieved by a commercial solver, show that the proposed approach is able to behave satisfactorily.
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.
