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) algorith...
详细信息
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 hybridmilp/cp algorithm is both effective and efficient compared to the pure milp or cp method alone.
暂无评论