Sequencing activities in a project network with resource complementarity : further results

We address the issue of optimal resource allocation, and more specifically, the analysis of complementarity of resources (primary resource or P-resource and supportive resource or S-resource) to activities in a project. In this paper we present new computational results of a Genetic Algorithm, based in a random keys alphabet.

[1]  Salah E. Elmaghraby,et al.  Project Management { Multiple Resources Allocation , 2008 .

[2]  José António Oliveira.  Scheduling the truckload operations in automatic warehouses , 2007, Eur. J. Oper. Res..

[3]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[4]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[5]  Salah E. Elmaghraby,et al.  Duration oriented resource allocation strategy on multiple resources projects under stochastic conditions , 2009 .

[6]  José A. Oliveira,et al.  Um algoritmo genético para programação de projectos em redes de actividades com complementaridade de recursos , 2010 .

[7]  J. C. Bean.  Genetics and random keys for sequencing amd optimization , 1993 .

[8]  M. Kremer,et al.  The O-Ring Theory of Economic Development , 1993 .

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[11]  José António Oliveira.  A Genetic Algorithm with a Quasi-local Search for the Job Shop Problem with Recirculation , 2004, WSC.

[12]  Luís M. S. Dias,et al.  Solving the Job Shop Problem with a random keys genetic algorithm with instance parameters , 2010 .

[13]  José A. Oliveira,et al.  On resource complementarity in activity networks: further results , 2010 .

[14]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .