{"id":"https://openalex.org/W2264768930","doi":"https://doi.org/10.4236/ajor.2016.61010","title":"An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors","display_name":"An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2264768930","doi":"https://doi.org/10.4236/ajor.2016.61010","mag":"2264768930"},"language":"en","primary_location":{"id":"doi:10.4236/ajor.2016.61010","doi":"https://doi.org/10.4236/ajor.2016.61010","is_oa":true,"landing_page_url":"https://doi.org/10.4236/ajor.2016.61010","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=63145","source":{"id":"https://openalex.org/S2764800949","display_name":"American Journal of Operations Research","issn_l":"2160-8830","issn":["2160-8830","2160-8849"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Operations Research","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=63145","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011686734","display_name":"Ruzayn Quaddoura","orcid":"https://orcid.org/0000-0002-6085-7212","observed_orcids":["https://orcid.org/0000-0002-6085-7212"]},"institutions":[{"id":"https://openalex.org/I153687341","display_name":"Zarqa University","ror":"https://ror.org/01wf1es90","country_code":"JO","type":"education","lineage":["https://openalex.org/I153687341"]}],"countries":["JO"],"is_corresponding":true,"raw_author_name":"Ruzayn Quaddoura","raw_affiliation_strings":["Department of Computer Science, Faculty of Information Technology, Zarqa University, Zarqa, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technology, Zarqa University, Zarqa, Jordan","institution_ids":["https://openalex.org/I153687341"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011686734"],"corresponding_institution_ids":["https://openalex.org/I153687341"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00642961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":"06","issue":"01","first_page":"75","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4918999969959259,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.4918999969959259,"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"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.27950000762939453,"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.12710000574588776,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.7269999980926514},{"id":"https://openalex.org/keywords/bipartite-digraphs","display_name":"bipartite digraphs","score":0.8679999709129333},{"id":"https://openalex.org/keywords/two-processor-scheduling","display_name":"two-processor scheduling","score":0.6290000081062317},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9750000238418579},{"id":"https://openalex.org/keywords/precedence-constraints","display_name":"precedence constraints","score":0.7170000076293945},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.8790000081062317},{"id":"https://openalex.org/keywords/optimal-scheduling-algorithm","display_name":"optimal scheduling algorithm","score":0.5759999752044678},{"id":"https://openalex.org/keywords/linear-time-algorithms","display_name":"linear-time algorithms","score":0.5910000205039978}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7684595584869385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6130636930465698},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.49048110842704773},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47642430663108826},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47152838110923767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43294796347618103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43121716380119324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41907715797424316},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4128255546092987},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39772799611091614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35942739248275757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32043159008026123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08020198345184326},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4236/ajor.2016.61010","doi":"https://doi.org/10.4236/ajor.2016.61010","is_oa":true,"landing_page_url":"https://doi.org/10.4236/ajor.2016.61010","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=63145","source":{"id":"https://openalex.org/S2764800949","display_name":"American Journal of Operations Research","issn_l":"2160-8830","issn":["2160-8830","2160-8849"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4236/ajor.2016.61010","doi":"https://doi.org/10.4236/ajor.2016.61010","is_oa":true,"landing_page_url":"https://doi.org/10.4236/ajor.2016.61010","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=63145","source":{"id":"https://openalex.org/S2764800949","display_name":"American Journal of Operations Research","issn_l":"2160-8830","issn":["2160-8830","2160-8849"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"American Journal of Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320326306","display_name":"Zarqa University","ror":"https://ror.org/01wf1es90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2264768930.pdf","grobid_xml":"https://content.openalex.org/works/W2264768930.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1973538756","https://openalex.org/W1998978603","https://openalex.org/W2011039300","https://openalex.org/W2063530598","https://openalex.org/W2078418199","https://openalex.org/W2089340573","https://openalex.org/W2092333800","https://openalex.org/W2098135206","https://openalex.org/W2148130397","https://openalex.org/W2581172100","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4205546094","https://openalex.org/W7099851149","https://openalex.org/W2089340573","https://openalex.org/W2156837885","https://openalex.org/W2057789083","https://openalex.org/W6884579361","https://openalex.org/W2015106054","https://openalex.org/W7099357678","https://openalex.org/W2001561787","https://openalex.org/W2128755407"],"abstract_inverted_index":{"Given":[0],"n":[1],"unit":[2,20],"execution":[3],"time":[4,22,78],"(UET)":[5],"tasks":[6,31],"whose":[7],"precedence":[8],"constraints":[9],"form":[10],"a":[11,67],"directed":[12],"acyclic":[13],"graph,":[14],"the":[15,30,40,46,56,86],"arcs":[16],"are":[17,48],"associated":[18],"with":[19],"communication":[21],"(UCT)":[23],"delays.":[24],"The":[25],"problem":[26,61],"is":[27,65],"to":[28,38,80],"schedule":[29,84],"on":[32],"two":[33],"identical":[34],"processors":[35],"in":[36,45,62,73],"order":[37],"minimize":[39],"makespan.":[41],"Several":[42],"polynomial":[43],"algorithms":[44],"literature":[47],"proposed":[49],"for":[50,85],"special":[51],"classes":[52],"of":[53,58,88,91],"digraphs,":[54],"but":[55],"complexity":[57],"solving":[59],"this":[60,74],"general":[63],"case":[64],"still":[66],"challenging":[68],"open":[69],"question.":[70],"We":[71],"present":[72],"paper":[75],"an":[76,82],"O(n)":[77],"algorithm":[79],"compute":[81],"optimal":[83],"class":[87],"bipartite":[89],"digraphs":[90],"depth":[92],"one.":[93]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}