{"id":"https://openalex.org/W1998978603","doi":"https://doi.org/10.1142/s0129626493000083","title":"THE TIME COMPLEXITY OF SCHEDULING INTERVAL ORDERS WITH COMMUNICATION IS POLYNOMIAL","display_name":"THE TIME COMPLEXITY OF SCHEDULING INTERVAL ORDERS WITH COMMUNICATION IS POLYNOMIAL","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W1998978603","doi":"https://doi.org/10.1142/s0129626493000083","mag":"1998978603"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626493000083","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626493000083","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5047703641","display_name":"Hesham Ali","orcid":"https://orcid.org/0000-0001-6675-7987"},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HESHAM H. ALI","raw_affiliation_strings":["Department of Mathematics and Computer Science,  University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","Department of Mathematics and Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science,  University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054669233","display_name":"Hesham El\u2010Rewini","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"HESHAM EL-REWINI","raw_affiliation_strings":["Department of Mathematics and Computer Science,  University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","Department of Mathematics and Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science,  University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Nebraska at Omaha, Omaha, NE 68182\u20130243, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047703641"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":1.5121,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.84557979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"03","issue":"01","first_page":"53","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9955000281333923,"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"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9955000281333923,"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.9941999912261963,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9868000149726868,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6897121071815491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6628056168556213},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6110084652900696},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5865107774734497},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.49675971269607544},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4842836260795593},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4733215272426605},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4633150100708008},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42971915006637573},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.427964448928833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3969068229198456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3942683935165405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3612707853317261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.328959196805954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2995380163192749},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2831656038761139},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27794185280799866},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14319485425949097},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08507075905799866}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6897121071815491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6628056168556213},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6110084652900696},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5865107774734497},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.49675971269607544},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4842836260795593},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4733215272426605},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4633150100708008},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42971915006637573},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.427964448928833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3969068229198456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3942683935165405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3612707853317261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.328959196805954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2995380163192749},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2831656038761139},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27794185280799866},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14319485425949097},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08507075905799866},{"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.1142/s0129626493000083","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626493000083","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W3012609114","https://openalex.org/W2584187496","https://openalex.org/W2003327526","https://openalex.org/W4226218108","https://openalex.org/W2008132520","https://openalex.org/W2365404043"],"abstract_inverted_index":{"Papadimitrjou":[0],"and":[1,99],"Yannakakis":[2],"showed":[3],"that":[4,39,79],"unit":[5],"execution":[6,47,91],"time":[7,17,88],"tasks":[8,96],"in":[9,15,86,128],"interval":[10,75,130],"orders":[11],"can":[12,83],"be":[13,84],"scheduled":[14],"linear":[16],"on":[18,66],"N":[19,67],"processors":[20,68],"when":[21,69,89],"communication":[22,65,103],"cost":[23,92,104],"is":[24,49,73,97,123],"ignored.":[25],"The":[26],"objective":[27],"function":[28],"was":[29],"to":[30,45,101,116],"minimize":[31,117],"the":[32,40,58,70,90,94,102,118,124,129],"schedule":[33,119],"length.":[34],"They":[35],"have":[36],"also":[37],"shown":[38],"generalization":[41],"of":[42,60,93,108,114,126],"this":[43,54,80],"problem":[44,59,82],"arbitrary":[46],"times":[48],"NP-":[50],"complete":[51],".":[52],"In":[53],"paper,":[55],"we":[56],"study":[57],"scheduling":[61,81],"task":[62,71],"graphs":[63],"with":[64],"graph":[72],"an":[74,112],"order.":[76,131],"We":[77,110],"prove":[78],"solved":[85],"polynomial":[87],"system":[95],"identical":[98],"equal":[100],"between":[105],"any":[106],"pair":[107],"processors.":[109],"introduce":[111],"algorithm":[113],"O(Ne)":[115],"length,":[120],"where":[121],"e":[122],"number":[125],"arcs":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}