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.
Mots-clés : project scheduling, skills, branch-and-bound method
@article{RO_2007__41_2_155_0,
author = {Bellenguez-Morineau, Odile and N\'eron, Emmanuel},
title = {A branch-and-bound method for solving multi-skill project scheduling problem},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {155--170},
publisher = {EDP-Sciences},
volume = {41},
number = {2},
year = {2007},
doi = {10.1051/ro:2007015},
mrnumber = {2341438},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro:2007015/}
}
TY - JOUR AU - Bellenguez-Morineau, Odile AU - Néron, Emmanuel TI - A branch-and-bound method for solving multi-skill project scheduling problem JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2007 SP - 155 EP - 170 VL - 41 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro:2007015/ DO - 10.1051/ro:2007015 LA - en ID - RO_2007__41_2_155_0 ER -
%0 Journal Article %A Bellenguez-Morineau, Odile %A Néron, Emmanuel %T A branch-and-bound method for solving multi-skill project scheduling problem %J RAIRO - Operations Research - Recherche Opérationnelle %D 2007 %P 155-170 %V 41 %N 2 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro:2007015/ %R 10.1051/ro:2007015 %G en %F RO_2007__41_2_155_0
Bellenguez-Morineau, Odile; Néron, Emmanuel. A branch-and-bound method for solving multi-skill project scheduling problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 2, pp. 155-170. doi : 10.1051/ro:2007015. http://www.numdam.org/articles/10.1051/ro:2007015/
[1] , and, Satisfiability tests and time-bound adjustments for cumulative scheduling problems, in Ann. Oper. Res. 92 (1999) 305-333. | Zbl
[2] , and, Ordonnancement des formations des télé-opérateurs dans un centre de contacts clients, in Proc. ROADEF 2005, Tours, France (2005).
[3] and, Méthodes approchées pour le problème de gestion de projet multi-compétence, in École d'Automne de Recherche Opérationnelle, TOURS, France (2003) 39-42.
[4] and, An exact method for solving the multi-skill project scheduling problem, in Proc. Operations Research (OR2004), Tilburg, The Netherlands (2004) 97-98.
[5] and, Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills, in Proc. Practice and Theory of Automated Timetabling (PATAT2004), Pittsburgh, PA, USA (2004) 429-432.
[6] and, Methods for solving the multi-skill project scheduling problem, in Proc. 9th International Workshop on Project Management and Scheduling (PMS2004), Nancy, France (2004) 66-69.
[7] , Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan. Eur. J. Oper. Res. 29 (1987) 298-306. | Zbl
[8] and, Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO-RO 25 (1991) 23-38. | Numdam | Zbl
[9] and. Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32 (1998) 283-297. | Zbl
[10] and, Agile workforce evaluation: a framework for cross-training and coordination. IIE Transactions 36 (2004).
[11] ,,, and, Simulated annealing for multi-mode resource-constrained project scheduling problem. Ann. Oper. Res. 102 (2001) 137-155. | Zbl
[12] , Scheduling of resource-constrained projects. Kluwer Academic Publishers (2000). | MR | Zbl
[13] and, On the computational complexity of (maximum) class scheduling. Eur. J. Oper. Res. 54 (1991) 23-28. | Zbl
[14] and, Psplib - a project scheduling problem library. Eur. J. Oper. Res. 96 (1997) 205-216. | Zbl
[15] and, Psplib - a project scheduling problem library. pages ftp://ftp.bwl.uni-kiel.de/pub/operations-research/psplib/html/indes.html, (2000). | Zbl
[16] , and, Exact and approximation algorithms for the operational fixed interval scheduling problem. Eur. J. Oper. Res. 82 (1995) 190-205. | Zbl
[17] , and, Ordonnancement de tâches sous contraintes: une approche énergétique. RAIRO-APII 26 (1992) 453-481. | Zbl
[18] ,, and, An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science 44 (1998) 714-729. | Zbl
[19] , Lower bounds for the multi-skill project scheduling problem, in Proc. 8th International Workshop on Project Management and Scheduling (PMS2002), Valencia, Spain (2002) 274-277.
[20] , A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics 29 to be published.
[21] , and, Modèle de compétence: vers un formalisme, in Proc. Conférence francophone de MOdélisation et de SIMulation (MOSIM2004), Nantes, France (2004) 503-510.
[22] and, The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. 119 (1999) 538-556. | Zbl
[23] ,, and, Scheduling differentially-skilled staff to multiple projects with severe deadlines. Eur. J. Oper. Res. (2005). Submitted to the special issue of PMS (2004).
[24] and, Multi-mode resource constrained project scheduling problem by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res. 107 (1998) 431-450. | Zbl
[25] , and, Semi-active, active and non-delay schedules for the resource constrained project scheduling problem. Eur. J. Oper. Res. 80 (1995) 94-102. | Zbl
[26] , Personnel assignment problem with hierarchical ordering constraints. in Proc. Personnel assignment Problem with hierarchical ordering constraints (2003) 493-510.
Cité par Sources :
