{"id":"https://openalex.org/W1492077731","doi":"https://doi.org/10.1007/3-540-48224-5_70","title":"The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts","display_name":"The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1492077731","doi":"https://doi.org/10.1007/3-540-48224-5_70","mag":"1492077731"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48224-5_70","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_70","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]},{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Dept. of Computer Science, University of California, Riverside, CA, 92521, USA","University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of California, Riverside, CA, 92521, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California","institution_ids":["https://openalex.org/I2803209242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065289106","display_name":"J\u00e1nos Csirik","orcid":"https://orcid.org/0000-0003-3870-0363"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00e1nos Csirik","raw_affiliation_strings":["Department of Computer Science, J\u00f3zsef Attila University, \u00c1rp\u00e1d t\u00e9r 2, H-6720, Szeged, Hungary","J\u00f3zsef Attila University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, J\u00f3zsef Attila University, \u00c1rp\u00e1d t\u00e9r 2, H-6720, Szeged, Hungary","institution_ids":[]},{"raw_affiliation_string":"J\u00f3zsef Attila University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089062943","display_name":"Csan\u00e1d Imreh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Csan\u00e1d Imreh","raw_affiliation_strings":["Department of Computer Science, J\u00f3zsef Attila University, \u00c1rp\u00e1d t\u00e9r 2, H-6720, Szeged, Hungary","J\u00f3zsef Attila University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, J\u00f3zsef Attila University, \u00c1rp\u00e1d t\u00e9r 2, H-6720, Szeged, Hungary","institution_ids":[]},{"raw_affiliation_string":"J\u00f3zsef Attila University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008465806","display_name":"John Noga","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"John Noga","raw_affiliation_strings":["Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria","[TU Graz]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"[TU Graz]","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Mathematical Inst., AS CR, \u017ditn\u00e1 25, CZ-11567, Praha 1, Czech Republic","AS CR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Inst., AS CR, \u017ditn\u00e1 25, CZ-11567, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"AS CR","institution_ids":[]}]},{"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/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria","[TU Graz]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik B, TU Graz, Steyrergasse 30, A-8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"[TU Graz]","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"862","last_page":"874"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9922000169754028,"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/computer-science","display_name":"Computer science","score":0.8390634059906006},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7462432384490967},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6878854036331177},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6347270607948303},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5911867618560791},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.5625637769699097},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5575903058052063},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5377678275108337},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5151804685592651},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5118014216423035},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.48033156991004944},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43487048149108887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3028680980205536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2884823679924011},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2379930317401886},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.19757431745529175},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11852279305458069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11465659737586975}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8390634059906006},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7462432384490967},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6878854036331177},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6347270607948303},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5911867618560791},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5625637769699097},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5575903058052063},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5377678275108337},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5151804685592651},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5118014216423035},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.48033156991004944},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43487048149108887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3028680980205536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2884823679924011},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2379930317401886},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.19757431745529175},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11852279305458069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11465659737586975},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/3-540-48224-5_70","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48224-5_70","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:publications/74c11aec-fbe1-46ae-8369-ee7e3f5641e4","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/74c11aec-fbe1-46ae-8369-ee7e3f5641e4","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":"Chrobak, M, Csirik, J, Imreh, C, Noga, J, Sgall, J & Woeginger, G J 2001, The buffer minimization problem for multiprocessor scheduling with conflicts. in F Orejas, P G Spirakis & J Leeuwen, van (eds), Automata, languages and programming : proceedings 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Lecture Notes in Computer Science, vol. 2076, Springer, Berlin, pp. 862-874. https://doi.org/10.1007/3-540-48224-5_70","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/481d997b-9c30-47a9-a3c6-556d3f8eed7a","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/481d997b-9c30-47a9-a3c6-556d3f8eed7a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:663935","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=663935","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":"","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.5143","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.5143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cas.cz/~sgall/ps/buffer.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.3087","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.3087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cas.cz/~sgall/ps/buffer.ps","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:663935","is_oa":false,"landing_page_url":"http://repository.tue.nl/663935","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":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/74c11aec-fbe1-46ae-8369-ee7e3f5641e4","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/74c11aec-fbe1-46ae-8369-ee7e3f5641e4","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":"Automata, languages and programming : proceedings 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, 862 - 874","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W230344389","https://openalex.org/W1978007997","https://openalex.org/W1980672031","https://openalex.org/W2006379203","https://openalex.org/W2012329067","https://openalex.org/W2059453880","https://openalex.org/W2074826049","https://openalex.org/W2091570807","https://openalex.org/W2611515161","https://openalex.org/W2912168264","https://openalex.org/W4213047056","https://openalex.org/W7056210342"],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2101964286","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W212211351"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}