SciELO - Scientific Electronic Library Online

vol.24 número1Automatic target recognition on land using three dimensional (3D) laser radar and artificial neural networksNonlinear dynamic analysis and state space representation of a manipulator under viscoelastic material conditions índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados



Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google


South African Journal of Industrial Engineering

versión On-line ISSN 2224-7890
versión impresa ISSN 1012-277X


KAZEMIPOOR, H.; TAVAKKOLI-MOGHADDAM, R.  y  SHAHNAZARI-SHAHREZAEI, P.. Solving a novel multi-skilled project scheduling model by scatter search. S. Afr. J. Ind. Eng. [online]. 2013, vol.24, n.1, pp.121-131. ISSN 2224-7890.

A multi-skilled project scheduling problem (MSPSP) has generally been presented to schedule information technology projects in deterministic conditions. The contribution of this model is to consider the resources, called 'staff members'. These members are regarded as valuable, renewable, and discrete resources with different multiple skills. The different skills of staff members, as well as the project network's activity requirement of different skills, cause this problem to become a special type of multi-mode resource-constrained project scheduling problem (MM-RCPSP), with a huge number of modes. Taking into account the importance of this issue and the few studies performed on this problem, a novel mathematical model for the MSPSP is presented. Since the complexity of this problem is NP-hard, an efficient scatter search (SS) algorithm is developed to solve such a difficult problem. This proposed SS is capable of generating optimised solutions in small sizes, and the excellent solutions in large sizes are compared with the solutions reported by a proposed Tabu search (TS) algorithm.

        · resumen en Africano     · texto en Inglés     · Inglés ( pdf )


Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons