{"id":"https://openalex.org/W2020693573","doi":"https://doi.org/10.1080/00207218608920823","title":"Distributed algorithm for analysing activity networks","display_name":"Distributed algorithm for analysing activity networks","publication_year":1986,"publication_date":"1986-05-01","ids":{"openalex":"https://openalex.org/W2020693573","doi":"https://doi.org/10.1080/00207218608920823","mag":"2020693573"},"language":"en","primary_location":{"id":"doi:10.1080/00207218608920823","doi":"https://doi.org/10.1080/00207218608920823","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207218608920823","pdf_url":null,"source":{"id":"https://openalex.org/S36304393","display_name":"International Journal of Electronics","issn_l":"0020-7217","issn":["0020-7217","1362-3060"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electronics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5108198812","display_name":"Pranay Chaudhuri","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"PRANAY CHAUDHURI","raw_affiliation_strings":["Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108198812"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.5642,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65475469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":"5","first_page":"603","last_page":"607"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.961899995803833,"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"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.961899995803833,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.010300000198185444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.006399999838322401,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.7149999737739563},{"id":"https://openalex.org/keywords/activity-networks","display_name":"activity networks","score":0.9900000095367432},{"id":"https://openalex.org/keywords/project-scheduling","display_name":"project scheduling","score":0.8180000185966492},{"id":"https://openalex.org/keywords/critical-path","display_name":"critical path","score":0.6370000243186951},{"id":"https://openalex.org/keywords/timing-slack","display_name":"slack time","score":0.9940000176429749},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9020000100135803},{"id":"https://openalex.org/keywords/correctness-proofs","display_name":"correctness proofs","score":0.8679999709129333}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.877716064453125},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.729041576385498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6785368919372559},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6567392945289612},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5619387030601501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5145501494407654},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5033859610557556},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47123679518699646},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3472152054309845}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207218608920823","doi":"https://doi.org/10.1080/00207218608920823","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207218608920823","pdf_url":null,"source":{"id":"https://openalex.org/S36304393","display_name":"International Journal of Electronics","issn_l":"0020-7217","issn":["0020-7217","1362-3060"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Electronics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1977119258","https://openalex.org/W1990389251","https://openalex.org/W2007113317","https://openalex.org/W2013892304","https://openalex.org/W2029342163","https://openalex.org/W2097740541"],"related_works":["https://openalex.org/W1982293342","https://openalex.org/W1966097129","https://openalex.org/W2079444757","https://openalex.org/W2003101234","https://openalex.org/W7096262769","https://openalex.org/W2180091549","https://openalex.org/W2157122378","https://openalex.org/W2071155722","https://openalex.org/W7027808268","https://openalex.org/W2072725536"],"abstract_inverted_index":{"An":[0],"algorithm":[1,36],"for":[2,13],"computing":[3],"early":[4],"start":[5,8],"time,":[6,12],"late":[7],"time":[9],"and":[10,29],"slack":[11],"each":[14],"activity":[15,18],"of":[16,31,33],"an":[17],"network":[19],"on":[20],"a":[21],"distributed":[22,35],"computation":[23],"model,":[24],"is":[25],"proposed.":[26],"Computational":[27],"complexity":[28],"proof":[30],"correctness":[32],"the":[34],"are":[37],"also":[38],"given.":[39]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}