Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
From MaRDI portal
Publication:2268503
DOI10.1007/S10951-008-0079-3zbMATH Open1185.90112OpenAlexW2003284066MaRDI QIDQ2268503FDOQ2268503
Authors: Keith Womer, Haitao 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
Recommendations
- Branch-and-price approach for the multi-skill project scheduling problem
- A two-stage algorithm for a project scheduling problem with multi-skilled workforce constraints
- A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints
- An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
Benders decompositionresource-constrained project schedulinghybrid MILP/CP algorithmsmulti-skilled personnel
Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11) Stochastic scheduling theory in operations research (90B36) Discrete location and assignment (90B80)
Cites Work
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- Title not available (Why is that?)
- Measures of the restrictiveness of project networks
- Temporal constraint networks
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Title not available (Why is that?)
- Lower bounds for resource-constrained project scheduling problems.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Title not available (Why is that?)
- Mixed logical-linear programming
- Logic, optimization, and constraint programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Title not available (Why is that?)
- Scheduling and constraint propagation
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximation scheme for bin packing with conflicts
- Optimization guided lower and upper bounds for the resource investment problem
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- Title not available (Why is that?)
- Constraint partitioning in penalty formulations for solving temporal planning problems
- 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
- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
Cited In (24)
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem
- Software project scheduling under activity duration uncertainty
- On the complexity of efficient multi-skilled team composition
- Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates
- New pseudo polynomial algorithms for a partial resource-constrained project scheduling problem
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
- A new algorithm for resource-constrained project scheduling with breadth and depth of skills
- Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption
- Stable multi-skill workforce assignments
- 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
- Tabu search for proactive project scheduling problem with flexible resources
- Branch-and-price approach for the multi-skill project scheduling problem
- A biased random-key genetic algorithm for the project scheduling problem with flexible resources
- Multi-project scheduling problem under shared multi-skill resource constraints
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- An improved MIP-based approach for a multi-skill workforce scheduling problem
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
Uses Software
This page was built for publication: Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268503)
