| Issue |
RAIRO-Oper. Res.
Volume 41, Number 2, April-June 2007
ROADEF 05
|
|
|---|---|---|
| Page(s) | 155 - 170 | |
| DOI | https://doi.org/10.1051/ro:2007015 | |
| Published online | 15 June 2007 | |
A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
Laboratoire d'Informatique de l'Université de Tours,
64 av. Jean Portalis,
37200 Tours,
France; odile.morineau@univ-tours.fr
Received:
30
September
2005
Accepted:
25
January
2006
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.
Mathematics Subject Classification: 90C57 / 90B30
Key words: Project Scheduling / Skills / Branch-and-Bound method
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.