Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm

DOI10.1007/s10951-008-0079-3zbMath1185.90112OpenAlexW2003284066MaRDI QIDQ2268503

Keith Womer, Hai-Tao Li

Publication date: 8 March 2010

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0079-3

zbMATH Keywords

Benders decompositionresource-constrained project schedulinghybrid MILP/CP algorithmsmulti-skilled personnel

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Stochastic scheduling theory in operations research (90B36) Discrete location and assignment (90B80)

Related Items (19)

Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ A biased random-key genetic algorithm for the project scheduling problem with flexible resources ⋮ Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem ⋮ On the complexity of efficient multi-skilled team composition ⋮ Tabu search for proactive project scheduling problem with flexible resources ⋮ An improved MIP-based approach for a multi-skill workforce scheduling problem ⋮ Multi-project scheduling problem under shared multi-skill resource constraints ⋮ Branch-and-price approach for the multi-skill project scheduling problem ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ New model and heuristics for safety stock placement in general acyclic supply chain networks ⋮ A new algorithm for resource-constrained project scheduling with breadth and depth of skills ⋮ Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates ⋮ Stable multi-skill workforce assignments

Uses Software

• CHIP
• CPLEX
• PDDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling and constraint propagation
• Partitioning procedures for solving mixed-variables programming problems
• Temporal constraint networks
• Solving a cutting-stock problem with the constraint logic programming language CHIP
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Lower bounds for resource-constrained project scheduling problems.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Constraint programming based Lagrangian relaxation for the automatic recording problem
• Mixed logical-linear programming
• An approximation scheme for bin packing with conflicts
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Logic, Optimization, and Constraint Programming
• Measures of the restrictiveness of project networks
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• Optimization guided lower and upper bounds for the resource investment problem
• Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm