{"id":"https://openalex.org/W2144127568","doi":"https://doi.org/10.1109/saci.2011.5873054","title":"Application of modified shortest path algorithm for project duration assessment","display_name":"Application of modified shortest path algorithm for project duration assessment","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2144127568","doi":"https://doi.org/10.1109/saci.2011.5873054","mag":"2144127568"},"language":"en","primary_location":{"id":"doi:10.1109/saci.2011.5873054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci.2011.5873054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052189339","display_name":"Dalibor Dobrilovi\u0107","orcid":"https://orcid.org/0000-0002-3083-5725"},"institutions":[{"id":"https://openalex.org/I10572248","display_name":"Institut Mihajlo Pupin","ror":"https://ror.org/00jk2b778","country_code":"RS","type":"facility","lineage":["https://openalex.org/I10572248","https://openalex.org/I4068193"]},{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"D. Dobrilovic","raw_affiliation_strings":["Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia"],"affiliations":[{"raw_affiliation_string":"Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia","institution_ids":["https://openalex.org/I10572248","https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110043808","display_name":"Vesna Jevti\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I10572248","display_name":"Institut Mihajlo Pupin","ror":"https://ror.org/00jk2b778","country_code":"RS","type":"facility","lineage":["https://openalex.org/I10572248","https://openalex.org/I4068193"]},{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"V. Jevtic","raw_affiliation_strings":["Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia"],"affiliations":[{"raw_affiliation_string":"Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia","institution_ids":["https://openalex.org/I10572248","https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087900393","display_name":"Jelena Stojanov","orcid":"https://orcid.org/0000-0002-2237-8026"},"institutions":[{"id":"https://openalex.org/I10572248","display_name":"Institut Mihajlo Pupin","ror":"https://ror.org/00jk2b778","country_code":"RS","type":"facility","lineage":["https://openalex.org/I10572248","https://openalex.org/I4068193"]},{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"J. Stojanov","raw_affiliation_strings":["Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia"],"affiliations":[{"raw_affiliation_string":"Technical Faculty Mihajlo Pupin, University of Novi Sad, Zrenjanin, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Technical Faculty \u201cMihajlo Pupin,\u201d , Zrenjanin , Serbia","institution_ids":["https://openalex.org/I10572248","https://openalex.org/I170726198"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052189339"],"corresponding_institution_ids":["https://openalex.org/I10572248","https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":1.5728,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85650205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"495","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12734","display_name":"Information Systems and Technology Applications","score":0.9506000280380249,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12734","display_name":"Information Systems and Technology Applications","score":0.9506000280380249,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11006","display_name":"BIM and Construction Integration","score":0.9484000205993652,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.929099977016449,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.730881929397583},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7261594533920288},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.7072092294692993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.618054211139679},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5489214658737183},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5470158457756042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5420500040054321},{"id":"https://openalex.org/keywords/project-management","display_name":"Project management","score":0.49213045835494995},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4663502275943756},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.43540796637535095},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4230087399482727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3898119032382965},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21645942330360413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21396204829216003},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.18348386883735657},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16961464285850525},{"id":"https://openalex.org/keywords/systems-engineering","display_name":"Systems engineering","score":0.15492618083953857}],"concepts":[{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.730881929397583},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7261594533920288},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.7072092294692993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.618054211139679},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5489214658737183},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5470158457756042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5420500040054321},{"id":"https://openalex.org/C15952604","wikidata":"https://www.wikidata.org/wiki/Q179012","display_name":"Project management","level":2,"score":0.49213045835494995},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4663502275943756},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.43540796637535095},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4230087399482727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3898119032382965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21645942330360413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21396204829216003},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.18348386883735657},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16961464285850525},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.15492618083953857},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci.2011.5873054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci.2011.5873054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1511421931","https://openalex.org/W1590802680","https://openalex.org/W2006281768","https://openalex.org/W2042437518","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2237196758","https://openalex.org/W2248064281","https://openalex.org/W4247255165"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2388051136","https://openalex.org/W2364137215"],"abstract_inverted_index":{"As":[0],"one":[1],"of":[2,6,22,43,80,94,116],"the":[3,26,76,108,117],"triple":[4],"constraint":[5],"project":[7,9,59,89],"management,":[8],"completion":[10],"time":[11],"is":[12,17,98],"very":[13],"important":[14],"issue.":[15],"This":[16,73],"considerable":[18],"for":[19,25],"wide":[20],"range":[21],"projects,":[23],"especially":[24],"time-terminated":[27],"ones.":[28],"Beside":[29],"standard":[30],"network":[31,109],"planning":[32],"methods,":[33,45],"such":[34],"as":[35],"CPM,":[36],"PERT,":[37],"PDM":[38],"etc.":[39,72],"there":[40],"are":[41,51],"variety":[42],"alternative":[44],"based":[46],"on":[47,100],"previous":[48],"ones,":[49],"which":[50],"used":[52],"in":[53,78,88,107],"order":[54],"to":[55,103,112],"obtain":[56],"even":[57],"better":[58],"duration":[60,90],"evaluations.":[61],"In":[62],"these":[63],"methods":[64],"researchers":[65],"includes":[66],"simulation,":[67],"fuzzy":[68],"theory,":[69],"genetic":[70],"algorithms":[71,84,97],"paper":[74],"describes":[75],"approach":[77],"modification":[79,93],"shortest":[81,95],"path":[82,96,106,115],"search":[83],"and":[85],"their":[86],"usage":[87],"assessment.":[91],"Presented":[92],"focused":[99],"its":[101],"conversion":[102],"finding":[104,113],"longest":[105],"diagram":[110],"i.e.":[111],"critical":[114],"project.":[118]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}