Planning the stages of a license (bachelor) / master thesis with classical methods of graph theory
Закрыть
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
942 12
Ultima descărcare din IBN:
2024-03-24 20:21
Căutarea după subiecte
similare conform CZU
378.2 (120)
Высшее образование. Университеты. Академическое обучение (2640)
SM ISO690:2012
BÎCLEA, Diana. Planning the stages of a license (bachelor) / master thesis with classical methods of graph theory. In: The Scientific Journal of Cahul State University “Bogdan Petriceicu Hasdeu” Economic and Engineering Studies, 2017, nr. 2(2), pp. 108-115. ISSN 2587-313X.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
The Scientific Journal of Cahul State University “Bogdan Petriceicu Hasdeu” Economic and Engineering Studies
Numărul 2(2) / 2017 / ISSN 2587-313X /ISSNe 2587-3121

Planning the stages of a license (bachelor) / master thesis with classical methods of graph theory

CZU: 378.2

Pag. 108-115

Bîclea Diana
 
Universitatea de Stat „Bogdan Petriceicu Hasdeu“, Cahul
 
 
Disponibil în IBN: 24 martie 2018


Rezumat

This paper describes the process of planning the realization stages of a research thesis (license/master) and classical methods of graph theory are applied to the proposed ones. It is proposed a project model for planning the stages of realization of a thesis by using project management concepts, taking into account the requirements of the guide for the elaboration of a license/master thesis and methods of planning in applied mathematics (the Graph theory). In this paper the solution of the proposed problem was determined by the following methods: Gantt, Critical Path Method and PERT. It is advisable to run the research work for each method and the differences between methods.

Cuvinte-cheie
project, CPM, critical path,

PERT, the earliest time, the latest time, critical events, probability factor.

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-60722</cfResPublId>
<cfResPublDate>2017-12-29</cfResPublDate>
<cfVol>2</cfVol>
<cfIssue>2</cfIssue>
<cfStartPage>108</cfStartPage>
<cfISSN>2587-313X</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/60722</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Planning the stages of a license (bachelor) / master thesis with classical methods of graph theory</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>project; CPM; PERT; the earliest time; the latest time; critical path; critical events; probability factor.</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p><em>This paper describes the process of planning the realization stages of a research thesis (license/master) and classical methods of graph theory are applied to the proposed ones. It is proposed a project model for planning the stages of realization of a thesis by using project management concepts, taking into account the requirements of the guide for the elaboration of a license/master thesis and methods of planning in applied mathematics (the Graph theory). In this paper the solution of the proposed problem was determined by the following methods: Gantt, Critical Path Method and PERT. It is advisable to run the research work for each method and the differences between methods.</em></p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017-12-29T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2017-12-29T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-38868</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2017-12-29T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-38868</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-38868-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2017-12-29T24:00:00</cfStartDate>
<cfFamilyNames>Bîclea</cfFamilyNames>
<cfFirstNames>Diana</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>