×

A branch-and-bound method for solving multi-skill project scheduling problem. (English) Zbl 1154.90413

Summary: This paper deals with a special case of Project Scheduling problems 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.

MSC:

90B35 Deterministic scheduling theory in operations research
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut

Software:

PSPLIB
PDFBibTeX XMLCite
Full Text: DOI Numdam EuDML

References:

[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. · Zbl 0958.90037 · doi:10.1023/A:1018995000688
[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. Zbl0622.90049 · Zbl 0622.90049 · doi:10.1016/0377-2217(87)90243-8
[8] J. Carlier and B. Latapie, Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO-RO25 (1991) 23-38. Zbl0733.90036 · Zbl 0733.90036
[9] S. Hartmann and A. Drexl. Project scheduling with multiple modes: A comparison of exact algorithms. Networks32 (1998) 283-297. · Zbl 1002.90025 · doi:10.1002/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I
[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. · Zbl 0990.90513 · doi:10.1023/A:1010954031930
[12] R. Klein, Scheduling of resource-constrained projects. Kluwer Academic Publishers (2000). · Zbl 0949.90042
[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. · Zbl 0741.90035 · doi:10.1016/0377-2217(91)90320-U
[14] R. Kolisch and A. Sprecher, Psplib - a project scheduling problem library. Eur. J. Oper. Res.96 (1997) 205-216. Zbl0947.90587 · Zbl 0947.90587 · doi:10.1016/S0377-2217(96)00170-1
[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). · Zbl 0947.90587
[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. Zbl0905.90105 · Zbl 0905.90105 · doi:10.1016/0377-2217(93)E0335-U
[17] P. Lopez, J. Erschler and P. Esquirol, Ordonnancement de tâches sous contraintes: une approche énergétique. RAIRO-APII26 (1992) 453-481. Zbl0774.90046 · Zbl 0774.90046
[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. Zbl1004.90036 · Zbl 1004.90036 · doi:10.1287/mnsc.44.5.714
[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. · Zbl 0934.90040 · doi:10.1016/S0377-2217(99)00151-4
[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. · Zbl 0943.90042 · doi:10.1016/S0377-2217(97)00348-2
[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. Zbl0927.90054 · Zbl 0927.90054 · doi:10.1016/0377-2217(93)E0294-8
[26] I. Toroslu, Personnel assignment problem with hierarchical ordering constraints. in Proc. Personnel assignment Problem with hierarchical ordering constraints (2003) 493-510.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.