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

Odile Bellenguez-Morineau; Emmanuel Néron

RAIRO - Operations Research (2007)

  • Volume: 41, Issue: 2, page 155-170
  • ISSN: 0399-0559

Abstract

top
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.

How to cite

top

Bellenguez-Morineau, Odile, and Néron, Emmanuel. "A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem." RAIRO - Operations Research 41.2 (2007): 155-170. <http://eudml.org/doc/250128>.

@article{Bellenguez2007,
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. },
author = {Bellenguez-Morineau, Odile, Néron, Emmanuel},
journal = {RAIRO - Operations Research},
keywords = {Project Scheduling; Skills; Branch-and-Bound method},
language = {eng},
month = {6},
number = {2},
pages = {155-170},
publisher = {EDP Sciences},
title = {A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem},
url = {http://eudml.org/doc/250128},
volume = {41},
year = {2007},
}

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
DA - 2007/6//
PB - EDP Sciences
VL - 41
IS - 2
SP - 155
EP - 170
AB - 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.
LA - eng
KW - Project Scheduling; Skills; Branch-and-Bound method
UR - http://eudml.org/doc/250128
ER -

References

top
  1. Ph. Baptiste, C. Le Pape and W. Nuitjen, Satisfiability tests and time-bound adjustments for cumulative scheduling problems, in Ann. Oper. Res.92 (1999) 305–333.  
  2. O. Bellenguez, C. Canon and E. Néron, Ordonnancement des formations des télé-opérateurs dans un centre de contacts clients, in Proc. ROADEF 2005, Tours, France (2005).  
  3. O. Bellenguez and E. Néron, 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. O. Bellenguez and E. Néron, An exact method for solving the multi-skill project scheduling problem, in Proc. Operations Research (OR2004), Tilburg, The Netherlands (2004) 97–98.  
  5. O. Bellenguez and E. Néron, 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. O. Bellenguez and E. Néron, 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. J. Carlier, Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan. Eur. J. Oper. Res.29 (1987) 298–306.  
  8. J. Carlier and B. Latapie, Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO-RO25 (1991) 23–38.  
  9. S. Hartmann and A. Drexl. Project scheduling with multiple modes: A comparison of exact algorithms. Networks32 (1998) 283–297.  
  10. W. Hopp and M. Van Oyen, Agile workforce evaluation: a framework for cross-training and coordination. IIE Transactions36 (2004).  
  11. J. Josefowska, M. Mika, R. Rozycki, G. Waligora and J. Weglarz, Simulated annealing for multi-mode resource-constrained project scheduling problem. Ann. Oper. Res.102 (2001) 137–155.  
  12. R. Klein, Scheduling of resource-constrained projects. Kluwer Academic Publishers (2000).  
  13. A.W.J. Kolen and L.G. Kroon, On the computational complexity of (maximum) class scheduling. Eur. J. Oper. Res.54 (1991) 23–28.  
  14. R. Kolisch and A. Sprecher, Psplib - a project scheduling problem library. Eur. J. Oper. Res.96 (1997) 205–216.  
  15. R. Kolisch and A. Sprecher, Psplib - a project scheduling problem library. pages ftp://ftp.bwl.uni–kiel.de/pub/operations–research/psplib/html/indes.html, (2000).  
  16. L.G. Kroon, M. Salomon and L.N. Van Wassenhove, Exact and approximation algorithms for the operational fixed interval scheduling problem. Eur. J. Oper. Res.82 (1995) 190–205.  
  17. P. Lopez, J. Erschler and P. Esquirol, Ordonnancement de tâches sous contraintes: une approche énergétique. RAIRO-APII26 (1992) 453–481.  
  18. A. Mingozzi, V. Maniezzo, S. Riciardelli and L. Bianco, An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science44 (1998) 714–729.  
  19. E. Neron, 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. L. Ozdamar, A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics29 to be published.  
  21. G. Pepiot, N. Cheikhrouhou and R. Glardon, 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. B. De Reyck and W. Herroelen, The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res.119 (1999) 538–556.  
  23. E. Rolland, R.A. Patterson, K. Ward and B. Dodin, Scheduling differentially-skilled staff to multiple projects with severe deadlines. Eur. J. Oper. Res. (2005). Submitted to the special issue of PMS (2004).  
  24. A. Sprecher and A. Drexl, Multi-mode resource constrained project scheduling problem by a simple, general and powerful sequencing algorithm. Eur. J. Oper. Res.107 (1998) 431–450.  
  25. A. Sprecher, R. Kolisch and A. Drexl, Semi-active, active and non-delay schedules for the resource constrained project scheduling problem. Eur. J. Oper. Res.80 (1995) 94–102.  
  26. I. Toroslu, Personnel assignment problem with hierarchical ordering constraints. in Proc. Personnel assignment Problem with hierarchical ordering constraints (2003) 493–510.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.