Lokesh Pawar

GERT (Graphical Evaluation and Review Technique) est une technique d'analyse de r seau de gestion de projet qui permet un traitement probabiliste de la logique du r seau et de l'estimation du temps d'activit . Alan B. Pritsker, de l'universit de Purdue, a d crit cette approche en 1966. Par rapport d'autres techniques, le GERT n'est appliqu que tr s rarement des syst mes complexes. N anmoins, la strat gie GERT r pond la majorit des inconv nients de la technique PERT/CPM. Les boucles entre les t ches sont possibles avec GERT. La complexit du programme (simulation de Monte Carlo) n cessaire pour repr senter le syst me GERT est le principal inconv nient de la technique GERT. Cette tude utilise GERT pour valuer un projet hypoth tique de R&D, dans le but d'am liorer la performance de la planification du projet, de d terminer l'analyse du projet, l' quipement et les exigences en mati re de ressources, et d'aider les gestionnaires de projet modifier les strat gies du projet et fixer les taux contractuels.

Il GERT (Graphical Evaluation and Review Technique) una tecnica di analisi di rete per la gestione dei progetti che prevede la gestione probabilistica sia della logica della rete sia della stima dei tempi di attivit . Alan B. Pritsker della Purdue University ha descritto questo approccio nel 1966. Rispetto ad altre tecniche, il GERT viene applicato solo raramente a sistemi complicati. Tuttavia, la strategia GERT risolve la maggior parte degli inconvenienti della tecnica PERT/CPM. Con GERT sono possibili loop tra i compiti. La complessit del programma (simulazione Monte Carlo) necessario per rappresentare il sistema GERT lo svantaggio principale della tecnica GERT. Questo studio utilizza il GERT per valutare un ipotetico progetto di R&S, con l'obiettivo di migliorare le prestazioni della pianificazione del progetto, di de-terminare l'analisi del progetto, le attrezzature e i requisiti delle risorse, e di assistere i project manager nella modifica delle strategie del progetto e nella definizione dei tassi contrattuali.

GERT (Graphical Evaluation and Review Technique) ist eine Projektmanagement-Netzanalysetechnik, die eine probabilistische Handhabung sowohl der Netzlogik als auch der Vorgangszeitabsch tzung erm glicht. Dr. Alan B. Pritsker von der Purdue University beschrieb den Ansatz im Jahr 1966. Im Vergleich zu anderen Techniken wird GERT nur sehr selten in komplizierten Systemen eingesetzt. Dennoch werden mit der GERT-Strategie die meisten Nachteile der PERT/CPM-Technik behoben. Mit GERT sind Schleifen zwischen Aufgaben m glich. Die Komplexit t des Programms (Monte-Carlo-Simulation), das zur Darstellung des GERT-Systems erforderlich ist, ist der Hauptnachteil der GERT-Technik. In dieser Studie wird GERT zur Bewertung eines hypothetischen Forschungs- und Entwicklungsprojekts eingesetzt, um die Projektplanungsleistung zu verbessern, die Anforderungen an die Projektanalyse, die Ausr stung und die Ressourcen zu bestimmen und die Projektmanager bei der nderung der Projektstrategien und der Festlegung der Vertragss tze zu unterst tzen.

A GERT (Graphical Evaluation and Review Technique) uma t cnica de an lise de redes de gest o de projectos que permite o tratamento probabil stico da l gica de rede e da estimativa do tempo de actividade. O Dr. Alan B. Pritsker, da Universidade de Purdue, descreveu esta abordagem em 1966. Em compara o com outras t cnicas, a GERT s aplicada em sistemas complicados numa base muito pouco frequente. No entanto, a estrat gia GERT resolve a maioria dos inconvenientes da t cnica PERT/CPM. Os loops entre tarefas s o poss veis com GERT. A complexidade do programa (simula o de Monte Carlo) necess rio para representar o sistema GERT a principal desvantagem da t cnica GERT. Este estudo utiliza o GERT para avaliar um projecto hipot tico de I&D, com o objectivo de melhorar o desempenho do planeamento do projecto, de determinar a an lise do projecto, o equipamento e os requisitos de recursos, e de ajudar os gestores de projecto a modificar as estrat gias do projecto e a fixar as taxas do contrato.

GERT (Graphical Evaluation and Review Technique) is a project management network analysis technique that provides for probabilistic handling of both net-work logic and activity time estimation. Dr. Alan B. Pritsker of Purdue University described the approach in 1966. In comparison to other techniques, GERT is only applied in complicated systems on a very uncommon basis. Nonetheless, the GERT strategy addresses the majority of the PERT/CPM technique's drawbacks. Loops between tasks are possible with GERT. The complexity of the programme (Monte Carlo simulation) required to represent the GERT system is the primary disadvantage of the GERT technique. This study uses GERT to assess a hypothet-ical R&D project, with the goal of enhancing project planning performance, de-termining project analysis, equipment, and resource requirements, and assisting project managers in modifying project strategies and setting contract rates.

On the basis of this information a vehicle has to take the earlier decision about the path change or to stay with same route. The proposed protocol will also find the alternate optimized path to avoid the accident location. As the accident detected over the network, it will look for the affected area so that remaining vehicles can continue the transmission. The system also defined a low recovery and decision time where the vehicle selects the compromising path that it can select in case of accident. The presented work is being performed in city area with 2 lane system. The results and analysis is done in terms of delay and the data loss over the network.

Data Structure is a way of collection and arrangement of data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage. For example, we have data from a university professor's name "Tejas" and age 26. Here "Tejas" is a name which comprises of characters into it which collectively formed String which is a data type and 26 is of integer data type and these data types are than stored in memory according to the data structure assigned to the data type.