{"id":"https://openalex.org/W2149204009","doi":"https://doi.org/10.1080/10637199608915542","title":"SCHEDULING INTERVAL ORDERS IN PARALLEL","display_name":"SCHEDULING INTERVAL ORDERS IN PARALLEL","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2149204009","doi":"https://doi.org/10.1080/10637199608915542","mag":"2149204009"},"language":"en","primary_location":{"id":"doi:10.1080/10637199608915542","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199608915542","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5109876781","display_name":"Ernst Mayr","orcid":null},"institutions":[{"id":"https://openalex.org/I174004417","display_name":"Munich University of Applied Sciences","ror":"https://ror.org/012k1v959","country_code":"DE","type":"education","lineage":["https://openalex.org/I174004417"]},{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"ERNST W. MAYR","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische, Universit\u00e4t M\u00fcnchen, 80290 M\u00fcnchen, Germany","Institut f\u00fcr Informatik, Technische , Universit\u00e4t M\u00fcnchen , 80290 M\u00fcnchen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische, Universit\u00e4t M\u00fcnchen, 80290 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I174004417","https://openalex.org/I62916508"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische , Universit\u00e4t M\u00fcnchen , 80290 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109876781"],"corresponding_institution_ids":["https://openalex.org/I174004417","https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.4905,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68900482,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"1","first_page":"21","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/computer-science","display_name":"Computer science","score":0.6975497603416443},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6011136770248413},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5882925987243652},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5247492790222168},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5184371471405029},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.46131041646003723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41235750913619995},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4032430052757263},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31684035062789917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31585633754730225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2956267297267914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2838253974914551},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2657025456428528},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16616857051849365},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0846453309059143}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6975497603416443},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6011136770248413},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5882925987243652},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5247492790222168},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5184371471405029},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.46131041646003723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41235750913619995},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4032430052757263},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31684035062789917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31585633754730225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2956267297267914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2838253974914551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2657025456428528},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16616857051849365},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0846453309059143},{"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.1080/10637199608915542","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199608915542","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1515867632","https://openalex.org/W1556711032","https://openalex.org/W1590074528","https://openalex.org/W1973310391","https://openalex.org/W1978583881","https://openalex.org/W2003305391","https://openalex.org/W2004618348","https://openalex.org/W2011039300","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2071054511","https://openalex.org/W2072122885","https://openalex.org/W2079697168","https://openalex.org/W2089465933","https://openalex.org/W2092333800","https://openalex.org/W2173807572","https://openalex.org/W2288474359","https://openalex.org/W2343730655","https://openalex.org/W2400283444"],"related_works":["https://openalex.org/W2391861012","https://openalex.org/W2038088825","https://openalex.org/W1975203667","https://openalex.org/W2370328482","https://openalex.org/W4287882779","https://openalex.org/W2488336788","https://openalex.org/W4285469493","https://openalex.org/W2046896701","https://openalex.org/W1593224248","https://openalex.org/W2080384954"],"abstract_inverted_index":{"Interval":[0],"orders":[1,4],"are":[2,243],"partial":[3],"defined":[5],"by":[6,188],"having":[7],"interval":[8,22,58,119,206,240],"representations.":[9],"It":[10],"is":[11,20,29,81,221],"well":[12],"known":[13],"that":[14],"a":[15,41,45,84,117,138],"transitively":[16],"oriented":[17],"digraph":[18],"G":[19],"an":[21,57,70,143,161],"order":[23,59,120,207],"iff":[24],"its":[25],"(undirected)":[26],"complement":[27],"G\u00af":[28],"chordal.":[30],"We":[31,140],"investigate":[32],"parallel":[33,67],"algorithms":[34],"Tot":[35],"the":[36,92,147,157,168,177,217,222],"following":[37],"scheduling":[38,89,125,148,179],"problem:":[39],"Given":[40],"system":[42],"consisting":[43],"of":[44,48,95,146],"set":[46],"T":[47],"n":[49,122,131],"tasks":[50,103],"(each":[51],"requiring":[52],"unit":[53],"execution":[54],"time)":[55],"and":[56,63,109,134,182,190],"\u227a":[60],"over":[61],"T,":[62],"given":[64,106,118],"m":[65],"identical":[66],"processors,":[68],"construct":[69],"optimal":[71,162,169],"(i.e.,":[72],"minimal":[73,93],"length)":[74],"schedule":[75,100],"for":[76,86,176,216,225,235],"(T,":[77],"\u227a).":[78],"Our":[79,219],"algorithm":[80,193,220],"based":[82],"on":[83,137,185,239],"subroutine":[85],"computing":[87],"so-called":[88],"distances,":[90],"i.e.,":[91],"number":[94],"time":[96,136],"steps":[97],"needed":[98],"to":[99,155,198,205],"all":[101],"those":[102],"succeeding":[104],"some":[105,111,236],"task":[107,113,200],"t":[108,114],"preceding":[110],"other":[112],"1.":[115],"For":[116],"with":[121],"tasks,":[123],"these":[124],"distances":[126],"can":[127,152,194],"be":[128,153,196],"computed":[129],"using":[130,171],"3":[132],"processors":[133],"O(log2n)":[135],"CREW-PRAM.":[139],"then":[141],"give":[142],"incremental":[144],"version":[145],"distance":[149,180],"algorithm,":[150],"which":[151],"used":[154],"compute":[156],"empty":[158],"slots":[159],"in":[160,203,245],"schedule.":[163],"From":[164],"these,":[165],"we":[166],"derive":[167],"schedule,":[170],"no":[172],"more":[173],"resources":[174],"than":[175],"initial":[178],"computation":[181],"considerably":[183],"improving":[184],"previous":[186],"work":[187],"Sunder":[189],"He.":[191],"The":[192],"also":[195,232],"extended":[197],"handle":[199],"systems":[201],"which,":[202],"addition":[204],"precedence":[208],"constraints,":[209],"have":[210],"individual":[211],"deadlines":[212],"and/or":[213],"release":[214],"times":[215],"tasks.":[218],"first":[223],"NC-algorithm":[224],"this":[226],"problem.":[227],"As":[228],"another":[229],"application,":[230],"it":[231],"provides":[233],"NC-algorithms":[234],"graph":[237],"problems":[238],"graphs":[241],"(which":[242],"NP-complete":[244],"general).":[246]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}