Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources

Haitao Li

doi:10.1007/978-3-319-05443-8

Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources

Haitao Li

University of Missouri-St. Louis

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	American English
Title of host publication	Handbook on Project Management and Scheduling Vol.1
DOIs	https://doi.org/10.1007/978-3-319-05443-8
State	Published - 2015

Disciplines

Business Administration, Management, and Operations

Access to Document

10.1007/978-3-319-05443-8License: Unspecified

Cite this

@inbook{287780d3f9d745d0918738231248c79c,

title = "Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources",

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.",

author = "Haitao Li",

note = "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...",

year = "2015",

doi = "10.1007/978-3-319-05443-8",

language = "American English",

booktitle = "Handbook on Project Management and Scheduling Vol.1",

}

TY - CHAP

T1 - Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources

AU - Li, Haitao

N1 - 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...

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - https://link.springer.com/chapter/10.1007/978-3-319-05443-8_27

U2 - 10.1007/978-3-319-05443-8

DO - 10.1007/978-3-319-05443-8

M3 - Chapter

BT - Handbook on Project Management and Scheduling Vol.1

ER -

Benders Decomposition Approach for Project Scheduling with Multi-Purpose Resources

Abstract

Disciplines

Access to Document

Other files and links

Cite this