{"id":"https://openalex.org/W1989674505","doi":"https://doi.org/10.1007/s10951-011-0225-1","title":"Scheduling of pipelined operator graphs","display_name":"Scheduling of pipelined operator graphs","publication_year":2011,"publication_date":"2011-02-17","ids":{"openalex":"https://openalex.org/W1989674505","doi":"https://doi.org/10.1007/s10951-011-0225-1","mag":"1989674505"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-011-0225-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0225-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0225-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0225-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","Department of Computer Science, Utrecht University, Utrecht, The Netherlands 3508 TB"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Computer Science, Utrecht University, Utrecht, The Netherlands 3508 TB","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074901843","display_name":"Petra Schuurman","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Petra Schuurman","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","Department of Mathematics and COmputing Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and COmputing Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","Department of Mathematics and COmputing Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and COmputing Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.2925,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79110428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"3","first_page":"323","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9990000128746033,"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.9975000023841858,"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/treewidth","display_name":"Treewidth","score":0.7069757580757141},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5770201086997986},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5753049254417419},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5564963221549988},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5550310611724854},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5544210076332092},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48043060302734375},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4677291810512543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41463980078697205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40138760209083557},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38318002223968506},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.33320674300193787},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32625237107276917},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3186052441596985},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.30583399534225464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29321491718292236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29045072197914124},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.25009167194366455},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15319910645484924}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7069757580757141},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5770201086997986},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5753049254417419},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5564963221549988},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5550310611724854},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5544210076332092},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48043060302734375},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4677291810512543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41463980078697205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40138760209083557},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38318002223968506},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.33320674300193787},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32625237107276917},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3186052441596985},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.30583399534225464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29321491718292236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29045072197914124},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25009167194366455},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15319910645484924},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10951-011-0225-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0225-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0225-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/a9ca3f02-bf7e-4199-b5d9-1b75b746e9fe","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/a9ca3f02-bf7e-4199-b5d9-1b75b746e9fe","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bodlaender, H L, Schuurman, P & Woeginger, G J 2012, 'Scheduling of pipelined operator graphs', Journal of Scheduling, vol. 15, no. 3, pp. 323-332. https://doi.org/10.1007/s10951-011-0225-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:711509","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=711509","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1094-6136","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:711509","is_oa":false,"landing_page_url":"http://repository.tue.nl/711509","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1094-6136","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/a9ca3f02-bf7e-4199-b5d9-1b75b746e9fe","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/a9ca3f02-bf7e-4199-b5d9-1b75b746e9fe","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Scheduling, 15(3), 323 - 332. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10951-011-0225-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0225-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0225-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5724249324","display_name":null,"funder_award_id":"639.033.403","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989674505.pdf","grobid_xml":"https://content.openalex.org/works/W1989674505.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1492169292","https://openalex.org/W1508957747","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1977276352","https://openalex.org/W2011039300","https://openalex.org/W2016461430","https://openalex.org/W2026891055","https://openalex.org/W2039775944","https://openalex.org/W2059372025","https://openalex.org/W2075284083","https://openalex.org/W2087083200","https://openalex.org/W2093979815","https://openalex.org/W2114616381","https://openalex.org/W2130503577","https://openalex.org/W2136658137","https://openalex.org/W2581172100","https://openalex.org/W2913593077","https://openalex.org/W4285719527","https://openalex.org/W6679518843","https://openalex.org/W7067127618"],"related_works":["https://openalex.org/W239742334","https://openalex.org/W1511821218","https://openalex.org/W1480846237","https://openalex.org/W2088441646","https://openalex.org/W2012687409","https://openalex.org/W143512583","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3037533092","https://openalex.org/W1726008105"],"abstract_inverted_index":{"We":[0,52,100],"investigate":[1],"a":[2,54,68,73,98,113,128,151],"class":[3],"of":[4,12,49,116,131,150],"scheduling":[5],"problems":[6],"that":[7,143],"arise":[8],"in":[9,21],"the":[10,45,50,60,64,88,91,148],"optimization":[11],"SQL":[13],"queries":[14],"for":[15,59,107,144],"parallel":[16],"machines":[17],"(Chekuri":[18],"et":[19,80],"al.":[20,81],"PODS\u201995,":[22],"pp.":[23],"255\u2013265,":[24],"1995).":[25],"In":[26],"these":[27],"problems,":[28],"an":[29],"undirected":[30],"graph":[31,66,93],"is":[32,42,67,85,123,138],"used":[33],"to":[34,43,87],"represent":[35],"communication":[36],"and":[37],"inter-operator":[38],"parallelism.":[39],"The":[40,82],"goal":[41],"minimize":[44],"global":[46],"response":[47,105,114,129],"time":[48,56,75,115,118,130,133,153],"system.":[51],"provide":[53],"polynomial":[55,74,152],"approximation":[57,83,154],"scheme":[58,84],"special":[61],"cases":[62],"where":[63,90],"operator":[65,92,109,146],"tree,":[69],"thereby":[70],"improving":[71],"on":[72],"2.87-approximation":[76],"algorithm":[77,155],"by":[78,97],"Chekuri":[79],"generalized":[86],"case":[89,158],"has":[94],"treewidth":[95],"bounded":[96],"constant.":[99],"analyze":[101],"instances":[102],"with":[103,156],"small":[104],"times":[106],"general":[108,145],"graphs:":[110],"Deciding":[111],"whether":[112,127],"four":[117],"units":[119,134],"can":[120,135],"be":[121,136],"reached":[122,137],"easy,":[124],"but":[125],"deciding":[126],"six":[132],"NP-hard.":[139],"Finally,":[140],"we":[141],"prove":[142],"graphs":[147],"existence":[149],"worst":[157],"performance":[159],"guarantee":[160],"better":[161],"than":[162],"4/3":[163],"would":[164],"imply":[165],"P=NP.":[166]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}