SciELO - Scientific Electronic Library Online

 
vol.24 número1Planning empty container relocations under uncertaintyTwo-commodity perishable inventory system with bulk demand for one commodity índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Em processo de indexaçãoSimilares em Google

Compartilhar


South African Journal of Industrial Engineering

versão On-line ISSN 2224-7890
versão impressa ISSN 1012-277X

Resumo

KAZEMIPOOR, H.; TAVAKKOLI-MOGHADDAM, R.  e  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.

        · resumo em Africaner     · texto em Inglês     · Inglês ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons