You are here

Home » Content

The Investigation of Practical Application of Minimizing the Completion Time of Projects Using Optimization Algorithm Method

Journal Name:

  • International Journal of Science and Engineering Investigations

Publication Year:

  • 2017

Key Words:

Author NameUniversity of Author
Abstract (2. Language): 
Scheduling of a project is defined as determining time sequence in order to do a series of correlated activities that form a project. Minimizing is the completion time of project so that resource and priority constrains were satisfied. The main goal of research is to investigate the practical application of minimizing the completion time of project using optimization algorithm. For solving this problem a new algorithm of anarchic society optimization (ASO) has been designed. ASO just like other Meta-heuristic algorithms gives better results than methods based on priority rules. It is because of the nature of Meta-heuristic algorithms and these algorithms usually use the information related achieved responses in order to produce later responses, while the methods based on priority rules create any response independently. It should be emphasized that using a Meta-heuristic method alone, doesn't guarantee reaching optimal response. In this study, we use Taguchi methods for setting up the parameters of algorithm and implementing this algorithm on basis shows its efficiency in comparison to other existing algorithms.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-investigation-practical-application-minimizing-completion-time-projects-using-optimization-algorithm-method.pdf
  • 12
84
89
  • English

REFERENCES

References: 

[1] Demeulmeester, E. K. & Horroelen, W. S. (2002). Project Scheduling: A research Handbook, Springer.
[2] Blazewicz, J., Lenstra, J.K., and A.H.G. Rinnooy Kan, “Scheduling Subject to Resource Constraints: Classification and Complexity”, Discrete Applied Mthematics, 5(1983), PP. 11-24. Evalutionary Computation (CEC), June 5-8, New Orlens, LA, pp. 2586-2592, 2011.
[3] Bottcher, J., Drexl, A., Kolisch, R., Salewski, F. (1996). “Project Scheduling Under Partially Renewable Resource Constraints”. Technicl report 398 Manuscipte aus den Instituten fur Betriebswritschaftslehre der Universitat Kiel.
[4] Talbot, F.B (1982). “Resource-Constrined Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case”. Management Science, 38: pp. 1498-1509.
[5] Pritsker, A. B., Watters, L. J. and Wolfe, P. M., Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 1969, 16, 93-108.
[6] Demeulemeester, E. and Herroelen, W., New benchmark results for the resource-constrained project scheduling problem. Management Science, 1997, 43, 1485-1492.
[7] Brucker, P., Schoo, A. nd Thiele, O., A branch-and-bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 1998, to appear.
[8] Dorndorf, U., Pesch, E., Phan-Huy, T. A branch-and-bound algorithm for the resource-constrained project scheduling problem, Mathematical Methods of Operations Research 52(2000) 413-439.
[9] Kohlmorgen, U., H. Schmeck and K. Haase (1999), Experiences with Fine-Gained Parallel Genetic Algorithms, Annals of Opertions Reseach, 90, 203-219.
[10] S. Hartmann, A competitive genetic algorithm for resource-constrained poject scheduling, Naval Research Logistics 49 (2002) 433-448.
[11] J. Alcaraz, C. Maroto, A robust genetic algorithm for resource allocation in poject scheduling, Annals of Operations Research 102 (2001) 83-109.
International Journal of Science and Engineering Investigations, Volume 6, Issue 71, December 2017 89
www.IJSEI.com Paper ID: 67117-12
ISSN: 2251-8843
[12] S. Hartmann, A self-adapting genetic algorithm for project scheduling under resource constraints, Naval Research Logistics 49 (2002) 433-448.
[13] Y.C. Toklu, Appliction of genetic algorithm to construction scheduling with o without resouce constraints, Candian Journal of Civil Engineeing 29 (2002) 421-429.
[14] K.S. Hindi, H. Yang, K. Fleszar, An evolutionary algorithm for resource-constrained project scheduling, IEEE Transaction on Evolutionary Computation 6 (2002) 512-518.
[15] J. Coelho, L. Tavares, Comparative analysis of metaheuicstics for the resource constrained project scheduling problem, Technical, report, Depertmant of Civil Engineering, Instituto Superior Tecnico, Portugal.
[16] J. Gonclves, J. Mendes, A random key based genetic algorithm for the resource-constained poject scheduling problem. Technical report, Depatamento de Engenharia Universidade do Porto, 2003.
[17] Goncalves JF, Beirao NC. Um algoritmo genetic baseado em chaves aleatorias para sequenciamento de operacoes. Revista Associacao Portuguesa Investigacao Opeacional 1999;19:123-37 (in Portuguese).
[18] Mendes. J.J.M, Goncalves. J.F, Resende. M.G.C. A random key based genetic algorithm for the resource constrained project scheduling problem. Computers and Operations Research 36 (2009) 92-109.
[19] K. Nonobe, T. Ibaraki, Formulation and tabu search algorithm for the resource constrained project scheduling problem, in: C.C. Ribeiro, P. Hansen (Eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, 2002, pp. 557-588.
[20] N. Pan, P. Wen Hsaio, K. Chen, A study of project scheduling optimization using Tabu Search algorithm, Engineering Applications of Artificial Intelligence 21 (2008) 1101-1112.
[21] V. Valls, M.S. Quintailla, F. Ballestin, Resource-constrained project scheduling: A critical reordering heuristic, European Journal of Operational Research 149 (2003) 282-301.
[22] V. Valls, F. Ballestin, M.S. Quintanilla, Justification and RCPSP: A technique that pays, European Journal of Operational Research 165 (2005) 375-386.
[23] H. Zhang, X. Li, H. Li, F. Huang,”Particle swarm optimization-based schemes for resource-constrained project scheduling “, Automation in construction 14 (2005) 393-404.
[24] R.M. Chen, C,L, Wu, C.M. Wang, Sh.T. Lo, “Using novel particle swarn optimization scheme to solve resource-constrained scheduling problem in PSPLIB “, Expert Systems with Applications, Volume 37. Issue 3, 15 March, 2010, pp. 1899-1910.
[25] A. Ahmadi-Javid, P. Hooshangi-Tabrizi, An Anarchic Society Optimization Algorithm for a Flow-Shop Scheduling Problem with Multiple Transporters between Successive Machines, Proceedings of the 2012 International Conference Industrial Engineering and Operations Management Istanbul, Turkey, July 3-6, 2012.
[26] J.Kennedy and R. Eberhart, “Particle swarn optimization”, Proceedings of the IEEE International Conference on Neural Networks (Perth, Australia) 1942-1948, 1995.
[27] Kolisch, R. and A. Sprecher (1996), PSPLIB - A project scheduling library, European Journal of Operational Research,Vol. 96, pp. 205--216.
[28] Taguchi, G., 1986. Introduction to quality engineering. White Plains: Asian Productivity Organization/UNIPUB.
[29] R. Kolisch und S. Hartmann (2006): Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update, European Journal of Operational Research 174, 23-37, 2006.

Thank you for copying data from http://www.arastirmax.com