Abstract
This paper provides an overview of Software Project Scheduling problem as a combinatorial optimization problem. Since its inception by Alba, there have been multiple models to solve this problem. Metaheuristics provide high-level strategies capable of solving these problems efficiently. A set of metaheuristics used to solve this problem is presented, showing the resolution structure and its application. Among these we can find Simulated Annealing, Variable Neighborhood Search, Genetic Algorithms, and Ant Colony Optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., Chicano, J.F.: Software project management with gas. Information Sciences, 2380–2401 (2007)
Hromkovic, J.: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Springer, Heidelberg (2010)
Pham, Q.T., Nguyen, A.V., Misra, S.: Apply agile method for improving the efficiency of software development project at vng company. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Nguyen, H.-Q., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013, Part II. LNCS, vol. 7972, pp. 427–442. Springer, Heidelberg (2013)
Cafer, F., Misra, S.: Effective project leadership in computer science and engineering. In: Gervasi, O., Taniar, D., Murgante, B., Laganà, A., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2009, Part II. LNCS, vol. 5593, pp. 59–69. Springer, Heidelberg (2009)
Mishra, A., Misra, S.: People management in software industry: the key to success. ACM SIGSOFT Software Engineering Notes 35(6), 1–4 (2010)
Alba, E.: Análisis y diseño de algoritmos genéticos paralelos distribuidos. PhD thesis (June 1999)
Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley Publishing (2009)
Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization 8(2), 239–287 (2009)
Ozdamar, L., Ulusoy, G.: A survey on the resource-constrained project scheduling problem. IIE Transactions 27(5), 574–586 (1995)
Chicano, J.F.: Metaheurísticas e Ingeniería del Software. PhD thesis (February 2007)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)
Chang, C.K., Christensen, M.J., Zhang, T.: Genetic algorithms for project management. Ann. Softw. Eng. 11(1), 107–139 (2001)
Hart, W., Krasnogor, N., Smith, J. (eds.): Recent Advances in Memetic Algorithms (2004)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)
Rada-Vilela, J., Zhang, M., Seah, W.: A performance study on synchronicity and neighborhood size in particle swarm optimization. Soft Computing 17(6), 1019–1030 (2013)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation (1997)
Xiao, J., Ao, X.T., Tang, Y.: Solving software project scheduling problems with ant colony optimization. Computers and Operations Research 40(1), 33–46 (2013)
Crawford, B., Soto, R., Johnson, F., Monfroy, E.: Ants can schedule software projects. In: Stephanidis, C. (ed.) Posters, Part I, HCII 2013. CCIS, vol. 373, pp. 635–639. Springer, Heidelberg (2013)
Stutzle, T., Hoos, H.H.: Maxmin ant system. Future Generation Computer Systems 16(8), 889–914 (2000)
Johnson, F., Crawford, B., Palma, W.: Hypercube framework for aco applied to timetabling. In: Bramer, M. (ed.) Artificial Intelligence in Theory and Practice. IFIP AICT, vol. 217, pp. 237–246. Springer, Heidelberg (2006)
Parra, N., Carolina, D., Salazar, A., Edgar, J.: Metaheuristics to solve the software project scheduling problem. In: CLEI, pp. 1–10 (2012)
Mika, M., Waligra, G., Wglarz, J.: Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research 164(3), 639–668 (2005)
Hansen, P., Mladenovi, N., Hansen, P., Mladenovi, N., Gerad, L.C.D.: Variable neighborhood search: Methods and recent applications. In: Proceedings of MIC 1999, pp. 275–280 (1999)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts - towards memetic algorithms (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Crawford, B., Soto, R., Johnson, F., Misra, S., Paredes, F. (2014). The Use of Metaheuristics to Software Project Scheduling Problem. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8583. Springer, Cham. https://doi.org/10.1007/978-3-319-09156-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-09156-3_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09155-6
Online ISBN: 978-3-319-09156-3
eBook Packages: Computer ScienceComputer Science (R0)