A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- 1 April 2007
- journal article
- research article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 41 (2), 155-170
- https://doi.org/10.1051/ro:2007015
Abstract
This paper deals with a special case of Project Scheduling problem: there is a project to schedule, which is made up of activities linked by precedence relations. Each activity requires specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that must be assigned to the activity during its whole processing time. We search for an exact solution that minimizes the makespan, using a Branch-and-Bound method.Keywords
This publication has 13 references indexed in Scilit:
- Agile workforce evaluation: a framework for cross-training and coordinationIIE Transactions, 2004
- Simulated Annealing for Multi-Mode Resource-Constrained Project SchedulingAnnals of Operations Research, 2001
- The multi-mode resource-constrained project scheduling problem with generalized precedence relationsEuropean Journal of Operational Research, 1999
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithmEuropean Journal of Operational Research, 1998
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical FormulationManagement Science, 1998
- PSPLIB - A project scheduling problem libraryEuropean Journal of Operational Research, 1997
- Exact and approximation algorithms for the operational fixed interval scheduling problemEuropean Journal of Operational Research, 1995
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problemEuropean Journal of Operational Research, 1995
- On the computational complexity of (maximum) class schedulingEuropean Journal of Operational Research, 1991
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987