Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm |
| |
Authors: | Haitao Li Keith Womer |
| |
Affiliation: | (1) College of Business Administration, University of Missouri—St. Louis, One University Blvd., St. Louis, MO 63121, USA |
| |
Abstract: | We study an assignment type resource-con- strained project scheduling problem with resources being multi-skilled personnel
to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary
strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective cut-generating scheme based on temporal analysis in project scheduling is devised for
resolving resource conflicts. The computational study shows that our hybrid MILP/CP algorithm is both effective and efficient
compared to the pure MILP or CP method alone. |
| |
Keywords: | Resource-constrained project scheduling Multi-skilled personnel Hybrid MILP/CP algorithms Benders decomposition |
本文献已被 SpringerLink 等数据库收录! |