A Few Transformations and Comments Concerning a Programme, Used in Management of Time for Different Projects
Abstract
In the study of time management it is settled a graph of a work programme and starting from the order relations existent between different operations, then, the way of the critical path enabled the lets say approximate deduction of the realization date of the works ‘ensemble, fluctuation intervals, etc. Actually the way of the critical path is not by itself a method of order if is applied only for the already settled graph programme, meaning in the moment when the order of things has been done. Its role actually is to interpretate the graph from a temporal point of view and gives all the indications needed concerning the realization dates of different events of the programme or to enable the testing of different graphs of the same ensemble of works. Next, using a decomposition of a graph, notion that belongs to us and for which we give the determinating algorithm, we will put in a linear way all the connection between the activities included in the programme, which after a good partial analysis on pieces and then the global analysis of the programme given, using the corresponding programme graph.
References
[2] Constantinescu, D., Nistorescu, T. 2008. Managementul Proiectelor, Editura SITECH, Craiova, in Romanian.
[3] Iliescu, V., Gherghinescu, O. 2005. Managementelor Proiectelor, Editura Didactică și Pedagogică, Bucuresti, in Romanian.
[4] Kaufman, A., Desbazzeille, G. 1969. La mѐthode de chemin critique, Dunond, Paris.
[5] Rădescu, N., Rădescu, E. 1982. Probleme de teoria grafurilor, Editura Scrisul Românesc, Craiova, in Romanian.
[6] Rădescu, N., Rădescu, E. 1984. Determinarea unui flux de valoare minimă într-o reţea de transport redusă folosind o desfacere a reţelei, in Proceeding of Simpozion “Modelarea cibernetica a proceselor de productie”, 14-16 iunie 1984, vol. I, Bucuresti, in Romanian.
The Copyright Transfer Form to ASERS Publishing (The Publisher)
This form refers to the manuscript, which an author(s) was accepted for publication and was signed by all the authors.
The undersigned Author(s) of the above-mentioned Paper here transfer any and all copyright-rights in and to The Paper to The Publisher. The Author(s) warrants that The Paper is based on their original work and that the undersigned has the power and authority to make and execute this assignment. It is the author's responsibility to obtain written permission to quote material that has been previously published in any form. The Publisher recognizes the retained rights noted below and grants to the above authors and employers for whom the work performed royalty-free permission to reuse their materials below. Authors may reuse all or portions of the above Paper in other works, excepting the publication of the paper in the same form. Authors may reproduce or authorize others to reproduce the above Paper for the Author's personal use or for internal company use, provided that the source and The Publisher copyright notice are mentioned, that the copies are not used in any way that implies The Publisher endorsement of a product or service of an employer, and that the copies are not offered for sale as such. Authors are permitted to grant third party requests for reprinting, republishing or other types of reuse. The Authors may make limited distribution of all or portions of the above Paper prior to publication if they inform The Publisher of the nature and extent of such limited distribution prior there to. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in The Paper. This agreement becomes null and void if and only if the above paper is not accepted and published by The Publisher, or is with drawn by the author(s) before acceptance by the Publisher.