A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem

DOI10.1051/ro:2007015zbMath1154.90413OpenAlexW2022013911MaRDI QIDQ3598682

Odile Bellenguez-Morineau, Emmanuel 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/

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem ⋮ Scheduling and staffing multiple projects with a multi-skilled workforce ⋮ Workforce planning incorporating skills: state of the art ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption ⋮ On the complexity of efficient multi-skilled team composition ⋮ A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ A two‐layer approach for solving robust decentralized multiproject scheduling problem with multi‐skilled staff ⋮ Tabu search for proactive project scheduling problem with flexible resources ⋮ An improved MIP-based approach for a multi-skill workforce scheduling problem ⋮ Project scheduling with flexible resources: formulation and inequalities ⋮ Multi-project scheduling problem under shared multi-skill resource constraints ⋮ Methods to solve multi-skill project scheduling problem ⋮ Branch-and-price approach for the multi-skill project scheduling problem ⋮ Scheduling technicians and tasks in a telecommunications company ⋮ 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 ⋮ A classification scheme for integrated staff rostering and scheduling problems

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• On the computational complexity of (maximum) class scheduling
• PSPLIB -- a project scheduling problem library
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations
• Scheduling of resource-constrained projects
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Project scheduling with multiple modes: A comparison of exact algorithms
• Simulated annealing for multi-mode resource-constrained project scheduling

This page was built for publication: A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem