A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
From MaRDI portal
Publication:3598682
DOI10.1051/RO:2007015zbMATH Open1154.90413OpenAlexW2022013911MaRDI QIDQ3598682FDOQ3598682
Authors: Odile Bellenguez-Morineau, E. Néron
Publication date: 3 February 2009
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_2_155_0/
Recommendations
- Branch-and-price approach for the multi-skill project scheduling problem
- A note on ``Branch-and-price approach for the multi-skill project scheduling problem
- Methods to solve multi-skill project scheduling problem
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Lower bounds for a multi-skill project scheduling problem
- Multi-project scheduling problem under shared multi-skill resource constraints
- A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem
- A two-stage algorithm for a project scheduling problem with multi-skilled workforce constraints
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- PSPLIB -- a project scheduling problem library
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Scheduling of resource-constrained projects
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- Title not available (Why is that?)
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Simulated annealing for multi-mode resource-constrained project scheduling
- On the computational complexity of (maximum) class scheduling
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- Project scheduling with multiple modes: A comparison of exact algorithms
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
Cited In (23)
- A two‐layer approach for solving robust decentralized multiproject scheduling problem with multi‐skilled staff
- Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem
- Title not available (Why is that?)
- A classification scheme for integrated staff rostering and scheduling problems
- Project scheduling with flexible resources: formulation and inequalities
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem
- Scheduling technicians and tasks in a telecommunications company
- On the complexity of efficient multi-skilled team composition
- Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates
- A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem
- Methods to solve multi-skill project scheduling problem
- 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
- Workforce planning incorporating skills: state of the art
- 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 branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- Optimization of the integrated problem of employee timetabling and job shop scheduling
- Scheduling and staffing multiple projects with a multi-skilled workforce
- Multi-project scheduling problem under shared multi-skill resource constraints
- An improved MIP-based approach for a multi-skill workforce scheduling problem
Uses Software
This page was built for publication: A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598682)