Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Staffing projects often requires both assignment and scheduling decisions to be made, which leads to a computationally demanding large-scale optimization problem. In this chapter, we show that a general class of assignment-type resource-constrained project scheduling problems (RCPSPs) can be handled by a hybrid Benders decomposition (HBD) approach. Our HBD framework extends the classical Benders decomposition method (Benders, Numer Math 4:238–252, 1962) by integrating solution techniques in math programming and constraint programming (CP). Effective cut generation schemes are devised to improve the algorithm performance. Performance of our HBD is demonstrated on a project scheduling problem with multi-skilled workforce. Extensions to the basic HBD framework are discussed.
Original languageAmerican English
Title of host publicationHandbook on Project Management and Scheduling Vol.1
DOIs
StatePublished - 2015

Disciplines

  • Business Administration, Management, and Operations

Cite this