Abstract
This paper is concerned with the problem of resource-constrained project scheduling under multiple performing modes. A heuristic solution based on Genetic Algorithms is proposed. Furthermore, the resource leveling concept is incorporated into the procedure as a form of guidance in the search of a solution that yields not only the shortest duration, but a leveled solution as well. A comparison with more traditional approaches is provided using benchmarks available in the literature. The results show the efficiency of the proposed algorithm.
Preview
Unable to display preview. Download preview PDF.
References
BADIRU, A.B. Toward The Standardization Of Performance Measures For Project Scheduling Heuristics. IEEE Trans. On Eng. Mng., v. 35, n. 2, p. 80–89. 1988.
BENNINGTON, G.E. e McGININIS, L.F. A Critique Of Project Planning With Resource Constrain, In: Symp. on the theory of sched. and its appl. Lectures Notes in economic and mathematical systems. Springer-Verlag, p. 1–38. 1973.
BLAZEWICZ, J., LENSTRA, J.K. e RINNOOY KAN, A.G.H. Scheduling Subject To Resource Constraints: Classification And Complexity. Discrete Applied Mathematics. v. 5, p. 11–24. 1983.
BOCTOR, F.F. Some Efficient Multi-Heuristic Procedures For Resource-Constrained Project Scheduling. Europ. Jour. of Op. Res.. v. 49, p. 3–13. 1990.
DAVIS, E.W. e PATTERSON, J.H. A Comparison of Heuristic And Optimum Solutions In Resource-Constrained Project Scheduling. Management Science. v. 21, n. 8, p. 944–955. 1975.
DECKRO, R.F. and HEBERT, J.E. Resource Constrained Project Crashing. OMEGA. v. 17, n. 1, p. 69–79. 1989.
DREXEL, A. e GRUENEWALD, J. Nonpreemptive Multi-Mode Resource-Constrained Project Scheduling. IIE Transaction, v. 25, n. 5, p. 74–81. 1993.
ELMAGHRABY, S.E. Activity Networks: Project Planning and Control by Network Models. Wile, New York. 1977.
HOLLAND, J.H. Adaptation In Natural And Artificial Systems. University Of Michigan Press, Ann Arbor. 1975.
JONES, R.A. Resource Scheduling: A Monte Carlo Approach to CPM. Proceeding of CIB W-65. p. 422–427. 1984.
LENSTRA, J.K. e RINNOOY KAN, A.H.G. Complexity of Scheduling Under Precedence Constraints, Operations Research. v. 26, n. 1, p. 22–35. 1978
LI, K.Y., e WILLIS, R.J. An Iterative Scheduling Technique For Resource-Constrained Project Scheduling. Europ. Jour. Op. Res. v. 56, p. 370–379. 1992.
LÓPEZ, O.C., Um Algoritmo Evolutivo Para A Programação De Projetos Multi-Modos Com Nivelamento De Recursos Limitados. Tese de Dout., UFSC, 1995.
MODER, J.J., PHILLIPS, C.R. e DAVIS, E. W. Project Management With CPM, PERT And Precedence Diagramming. 3rd ed., Reinhold, New York. 1983.
MOHANTHY, R.P. e SIDDIQ, M.K. Multiple Projects Multiple Resources-Constrained Scheduling. Int. Jour. Prod. Res. v.27, n.2, p.261–280. 1989.
PATTERSON, J.H. Comparison of Exact Approaches For Solving The Multiple Constrained Resource Project Scheduling Problem. Mng. Science. v.30, n. 7, p. 854–867. 1984.
PATTERSON, J.H., TALBOT, F.B., SLOWINSKI, R. e WEGLARZ, J. Computational Experience With A Backtracking Algorithm For Solving A General Class Of Precedence And Resource-Constrained Scheduling Problems. Europ. Jour. Op. Res. v. 49. p. 68–79. 1990.
SLOWINSKI, R. Multiobjective Network Scheduling With Efficient Use Of Renewable And Nonrenewable Resources. Eur. J. Op.Res. v.7, p.265–273. 1981.
TALBOT, F.B. Resource-Constrained Project Scheduling With Time-Resource Tradeoffs: The Nonpreemptive Case. Mng. Sc. v.28, n.10, p. 1197–1210. 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, O.C., Barcia, R.M., Eyada, O., Gauthier, F.O. (1996). An evolutionary algorithm for resource-constrained project scheduling and multiple execution modes. In: Borges, D.L., Kaestner, C.A.A. (eds) Advances in Artificial Intelligence. SBIA 1996. Lecture Notes in Computer Science, vol 1159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61859-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-61859-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61859-1
Online ISBN: 978-3-540-70742-4
eBook Packages: Springer Book Archive