Designing an optimization model for preventing the waste time in the activity cycle of an organization
Subject Areas : Operation ResearchM. Taleghani 1 , Y. Moddabernia 2
1 -
2 -
Keywords: Optimization, Graph Theory, subgraph, Activity cycle, unit, work, working Time,
Abstract :
This article proposes an optimization model for preventing the waste of time in the educational and research activities' cycle of an organization such as a university. For this purpose and in order to increase efficiency and prevent the waste of time; the graph theory models have been used. The educational and research activities diagrams of a supposed university is drawn by the use of graphs theory model, and then these graphs are analyzed, then in order to design a model, the units, activities and the time of doing each activity are symbolized, and the collected data are presented in the form of matrix. In this article two procedures are suggested for optimization; using subgraphs for every activity cycle in order to shorten the activity cycles and minimizing the time of doing each work. The algorithm of time minimizing is based on recognizing and determining the edges with the most weight as the maximum time. Also the influential factors on the waste of time in activity cycle are recognized and then replaced or omitted.
[1] Bondly, A. J., and Murty, U., Graph theory with application, 2000.
[2] Butts, C., Network Inference, Error, and Informant (In) Accuracy: A Bayesian Approach, to appear in Social Networks, 2000.
[3] Kreher, Donald. L., Combinatorial algorithms, enumeration and search, CRC Press LLC, 2001.
[4] Yi, S., and Yen, S., A new technique for optimization problems in graph theory, IEEE, 2005.
[5] Zahedi, S., System analysis and design (fundamentals of management information system), Allameh Tabataba'ee university Press, 4-th Edition, 1381.
[6] Management and Plan organization, Guide direction for reforming the ways of doing work and informing techniques, article 7, honouring draft, highly administrative council of country, 1381.