Weighted Multi-Skill Resources Project Scheduling
Fawaz S. Al-Anzi, Khaled Al-Zame, Ali Allahverdi
DOI: 10.4236/jsea.2010.312131   PDF    HTML     5,614 Downloads   10,536 Views   Citations


In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new model where staff members can have several skills with different proficiency, i.e., a staff member is able to perform more than one kind of activity as well as the time need is complete the task assign depends on the staff individual skill. We call this model the Weighted-Multi-Skill Project Scheduling Problem (WMSPSP). In our model, an activity has specific skill requirements that must be satisfied. To solve this problem, we propose a lower bound that uses a linear programming scheme for the RCPSP.

Share and Cite:

F. Al-Anzi, K. Al-Zame and A. Allahverdi, "Weighted Multi-Skill Resources Project Scheduling," Journal of Software Engineering and Applications, Vol. 3 No. 12, 2010, pp. 1125-1130. doi: 10.4236/jsea.2010.312131.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] A. Elkhyari, C. Gueret and N. Jussien, “Solving Dynamic RCPSP Using Explanation-Based Constraint Programming,” http://www.emn.fr/jussien/publications/elkhyari-MAPSP03.pdf
[2] V. Valls, F. Ballestín and S. Quintanilla, “Justification and RCPSP: A Technique That Pays,” European Journal of Operational Research, Vol. 165, No. 2, September 2005, pp. 375-386. doi:10.1016/j.ejor.2004.04.008
[3] E. Neron, “Lower Bounds for the Multi-Skill Project Scheduling Problem,” Proceeding of the Eighth Inter-national Workshop on Project Management and Scheduling, Spain, 2002, pp. 274-277.
[4] P. Baptiste, C. Le Pape and W. Nuijten, “Satisfiability Tests and Time Bound Adjustments for Cumulative Scheduling Problems,” Annals of Operation Research, Vol. 92, No. 0, 1999, pp. 305-333 doi:10.1023/A: 1018995000688
[5] S. Dauzere-Peres, W. Roux and J. B. Lassere, “Multi-Resource Shop Scheduling with Resource Flexibility,” European Journal of Operational Research, Vol. 107, No. 2, June 1998, pp. 289-305. doi:10.1016/S0377-2217(97) 00341-X
[6] B. Jurish, “Scheduling Jobs in Shops with Multi-Purpose Machines,” Ph.D. Dissertation, University of Osnabrück, Osnabrück, 1992.
[7] R. Kolisch, “Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation,” European Journal of Operational Research, Vol. 90, No. 2, April 1996, pp. 320-322. doi: 10.1016/0377-2217(95)00357-6
[8] E. Neron, P. Baptiste and J. N. D. Gupta, “Solving Hybrid Flow Shop Problem Using Energetic Reasoning and Global Operations,” Omega, Vol. 29, No. 6, December 2001, pp. 501-511. doi:10.1016/S0305-0483 (01)00040-8
[9] A. Sprecher, “Resource-constrained Project Scheduling, Exacts Methods for the MultiMode Case,” Lectures Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, 1994.
[10] J. S. Coelho, “Generating RCPSP Instances with Known Optimal Solutions,” Proceedings of PMS, 2004
[11] J. S. Coelho and L. V. Tavares, “Comparative Analysis on Approximation Algorithms for the Resource Constrained Project Scheduling Problem,” PMS2002, Eighth International Workshop on Project Management
[12] R. Kolisch and S. Hartmann, “Experimental Investigation of Heuristics for Resource-Constrained Project Sche- duling: An Update,” European Journal of Operational Research, Vol. 174, No. 1, October 2006, pp. 23-37. doi:10.1016/j.ejor.2005.01.065
[13] R. Klein, A. Scholl, “Computing Lower Bounds by Destructive Improvement: An Application to Resource- Constrained Project Scheduling,” European Journal of Operational Research, Vol. 112, No. 2, January 1999, pp. 332-346. doi:10.1016/S0377-2217(97)00442-6
[14] J. Carlier and E. Neron, “On Linear Lower Bound for the Resource Constrained Project Scheduling Problem,” European Journal of Operational Research, Vol. 149, No. 2, September 2003, pp. 314-324. doi:10.1016/S0377- 2217(02)00763-4

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.