Loading...

Branch and bound algorithms for resource constrained project scheduling problem subject to cumulative resources

Chaleshtari, A. S ; Sharif University of Technology

390 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICIII.2011.40
  3. Abstract:
  4. 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
  5. Keywords:
  6. Cumulative resources ; Extension alternatives ; Minimal delaying alternatives ; Minimal forbidden sets ; Resource constrained project scheduling ; Cumulative resources ; Extension alternatives ; Minimal delaying alternatives ; Minimal forbidden set ; Resource constrained project scheduling ; Algorithms ; Branch and bound method ; Industrial engineering ; Innovation ; Linear programming ; Scheduling ; Information management
  7. Source: Proceedings - 2011 4th International Conference on Information Management, Innovation Management and Industrial Engineering, ICIII 2011, 26 November 2011 through 27 November 2011, Shenzhen ; Volume 1 , 2011 , Pages 147-152 ; 9780769545233 (ISBN)
  8. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6115033