Article ID: | iaor20081743 |
Country: | France |
Volume: | 41 |
Issue: | 2 |
Start Page Number: | 155 |
End Page Number: | 170 |
Publication Date: | Apr 2007 |
Journal: | RAIRO Operations Research |
Authors: | Nron Emmanuel, Bellenguez-Morineau Odile |
Keywords: | programming: branch and bound, personnel & manpower planning |
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.