hrcak mascot   Srce   HID

Izvorni znanstveni članak

AND/OR graphs and project management

Dušan Hvalica ; Faculty of Economics, Ljubljana, Slovenia

Puni tekst: engleski, pdf (2 MB) str. 193-197 preuzimanja: 44* citiraj
APA 6th Edition
Hvalica, D. (1997). AND/OR graphs and project management. Journal of computing and information technology, 5 (3), 193-197. Preuzeto s https://hrcak.srce.hr/150260
MLA 8th Edition
Hvalica, Dušan. "AND/OR graphs and project management." Journal of computing and information technology, vol. 5, br. 3, 1997, str. 193-197. https://hrcak.srce.hr/150260. Citirano 05.08.2020.
Chicago 17th Edition
Hvalica, Dušan. "AND/OR graphs and project management." Journal of computing and information technology 5, br. 3 (1997): 193-197. https://hrcak.srce.hr/150260
Harvard
Hvalica, D. (1997). 'AND/OR graphs and project management', Journal of computing and information technology, 5(3), str. 193-197. Preuzeto s: https://hrcak.srce.hr/150260 (Datum pristupa: 05.08.2020.)
Vancouver
Hvalica D. AND/OR graphs and project management. Journal of computing and information technology [Internet]. 1997 [pristupljeno 05.08.2020.];5(3):193-197. Dostupno na: https://hrcak.srce.hr/150260
IEEE
D. Hvalica, "AND/OR graphs and project management", Journal of computing and information technology, vol.5, br. 3, str. 193-197, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/150260. [Citirano: 05.08.2020.]

Sažetak
It is shown that projects can be described by AND/OR graphs and that the cost of the minimal solution subgraph can be defined so as to equal the shortest time for completing a project or the minimal costs of the project represented by the AND/ OR graph.

Ključne riječi
project management; network programming; AND/OR graphs

Hrčak ID: 150260

URI
https://hrcak.srce.hr/150260

Posjeta: 82 *