{"id":"https://openalex.org/W2070307035","doi":"https://doi.org/10.1016/j.parco.2012.01.001","title":"Scheduling for heterogeneous Systems using constrained critical paths","display_name":"Scheduling for heterogeneous Systems using constrained critical paths","publication_year":2012,"publication_date":"2012-01-27","ids":{"openalex":"https://openalex.org/W2070307035","doi":"https://doi.org/10.1016/j.parco.2012.01.001","mag":"2070307035"},"language":"en","primary_location":{"id":"doi:10.1016/j.parco.2012.01.001","doi":"https://doi.org/10.1016/j.parco.2012.01.001","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.parco.2012.01.001","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","norway-2","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","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/A5100753305","display_name":"Minhaj Ahmad Khan","orcid":"https://orcid.org/0000-0002-2375-7829","observed_orcids":["https://orcid.org/0000-0002-2375-7829"]},"institutions":[{"id":"https://openalex.org/I127670440","display_name":"Bahauddin Zakariya University","ror":"https://ror.org/05x817c41","country_code":"PK","type":"education","lineage":["https://openalex.org/I127670440"]}],"countries":["PK"],"is_corresponding":true,"raw_author_name":"Minhaj Ahmad Khan","raw_affiliation_strings":["Department of Computer Science, Bahauddin Zakariya University, Multan, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bahauddin Zakariya University, Multan, Pakistan","institution_ids":["https://openalex.org/I127670440"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100753305"],"corresponding_institution_ids":["https://openalex.org/I127670440"],"apc_list":{"value":2870,"currency":"USD","value_usd":2870},"apc_paid":null,"fwci":8.9523,"has_fulltext":false,"cited_by_count":124,"citation_normalized_percentile":{"value":0.97842527,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":"38","issue":"4-5","first_page":"175","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.7041000127792358,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.7041000127792358,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.15139999985694885,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.040300000458955765,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.7379999756813049},{"id":"https://openalex.org/keywords/heterogeneous-systems","display_name":"heterogeneous systems","score":0.871999979019165},{"id":"https://openalex.org/keywords/processor-assignment","display_name":"processor assignment","score":0.8320000171661377},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8510000109672546},{"id":"https://openalex.org/keywords/heft","display_name":"HEFT","score":0.7870000004768372},{"id":"https://openalex.org/keywords/dls","display_name":"DLS","score":0.5130000114440918},{"id":"https://openalex.org/keywords/lmt","display_name":"LMT","score":0.8489999771118164},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.8629999756813049}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8323245048522949},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6505069136619568},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5727479457855225},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5687676668167114},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5553966164588928},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41370221972465515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1815805733203888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1677984893321991},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1015988290309906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07306176424026489}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.parco.2012.01.001","doi":"https://doi.org/10.1016/j.parco.2012.01.001","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.parco.2012.01.001","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","norway-2","poland-70","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1522370717","https://openalex.org/W1969571387","https://openalex.org/W1989582918","https://openalex.org/W2003021478","https://openalex.org/W2019356799","https://openalex.org/W2023753260","https://openalex.org/W2031415642","https://openalex.org/W2043331236","https://openalex.org/W2077201683","https://openalex.org/W2086037892","https://openalex.org/W2086564156","https://openalex.org/W2096949818","https://openalex.org/W2097911714","https://openalex.org/W2113947516","https://openalex.org/W2118396891","https://openalex.org/W2119742251","https://openalex.org/W2125412556","https://openalex.org/W2129902685","https://openalex.org/W2136294350","https://openalex.org/W2140168147","https://openalex.org/W2144624157","https://openalex.org/W2148130397","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W2151085839","https://openalex.org/W2155951254","https://openalex.org/W2164631467","https://openalex.org/W2925006810","https://openalex.org/W4229934166","https://openalex.org/W4250089307","https://openalex.org/W4255366037","https://openalex.org/W4285719527","https://openalex.org/W6600228653","https://openalex.org/W6600688380","https://openalex.org/W6647419326","https://openalex.org/W6681209650","https://openalex.org/W6684521266"],"related_works":["https://openalex.org/W2117959818","https://openalex.org/W3172098","https://openalex.org/W2131363892","https://openalex.org/W2585768449","https://openalex.org/W2779893448","https://openalex.org/W2536208847","https://openalex.org/W2023971080","https://openalex.org/W2149294210","https://openalex.org/W1535233371","https://openalex.org/W1958965543"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}
