Title :
Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Cumulative Resources
Author :
Chaleshtarti, A.S. ; Shadrokh, Shahram
Author_Institution :
Ind. Eng. Dept., Sharif Univ. of Technol., Tehran, Iran
Abstract :
Renewable and nonrenewable resources are the most studied resource types in the field of resource-constrained project scheduling problems, however cumulative resources are another type of resources, widespread in practical cases that have been theoretically studied much less than the two aforementioned types. So in the current paper we study resource-constrained project scheduling problem subject to cumulative resources (RCPSP-Cu), focusing on development of exact algorithms for the problem. We customize three resource-constrained project scheduling problem (RCPSP) branch and bound algorithms of extension alternatives, minimal delaying alternatives and minimal forbidden sets for RCPSP-Cu. We perform extensive experimental analysis on all these algorithms and compare their efficiency with each other and also CPLEX solvers for solving different instances under different runtime limitations.
Keywords :
enterprise resource planning; renewable materials; scheduling; tree searching; CPLEX solvers; branch and bound algorithms; cumulative resources; nonrenewable resources; resource constrained project scheduling problem; Algorithm design and analysis; Availability; Job shop scheduling; Runtime; Schedules; Upper bound; cumulative resources; extension alternatives; minimal delaying alternatives; minimal forbidden sets; resource constrained project scheduling;
Conference_Titel :
Information Management, Innovation Management and Industrial Engineering (ICIII), 2011 International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-61284-450-3
DOI :
10.1109/ICIII.2011.40