{"id":"https://openalex.org/W2081855231","doi":"https://doi.org/10.1007/s00453-012-9668-9","title":"Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines","display_name":"Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines","publication_year":2012,"publication_date":"2012-06-21","ids":{"openalex":"https://openalex.org/W2081855231","doi":"https://doi.org/10.1007/s00453-012-9668-9","mag":"2081855231"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-012-9668-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9668-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5055825354","display_name":"Tom\u00e1\u0161 Ebenlendr","orcid":null},"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":"Tom\u00e1\u0161 Ebenlendr","raw_affiliation_strings":["Inst. of Mathematics, AS CR, \u017ditn\u00e1 25, 11567, Praha 1, Czech Republic","Inst. of Mathematics, AS CR, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. of Mathematics, AS CR, \u017ditn\u00e1 25, 11567, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Inst. of Mathematics, AS CR, Czech Republic","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014115669","display_name":"Marek Kr\u010d\u00e1l","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Marek Kr\u010d\u00e1l","raw_affiliation_strings":["Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","Inst. of Mathematics, AS CR, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Inst. of Mathematics, AS CR, Czech Republic","institution_ids":[]}]},{"author_position":"last","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/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Computer Science Inst. of Charles University, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","Inst. of Mathematics, AS CR, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Inst. of Charles University, Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Inst. of Mathematics, AS CR, Czech Republic","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061997850"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":20.4455,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.99516956,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"68","issue":"1","first_page":"62","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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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.9965000152587891,"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/theory-of-computation","display_name":"Theory of computation","score":0.8126487731933594},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6873214244842529},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6395325064659119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5486664175987244},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5367909669876099},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.471822589635849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43473783135414124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3940306305885315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37535780668258667},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34812620282173157},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34303349256515503},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3280680179595947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30305904150009155},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07811427116394043}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.8126487731933594},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6873214244842529},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6395325064659119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5486664175987244},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5367909669876099},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.471822589635849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43473783135414124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3940306305885315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37535780668258667},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34812620282173157},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34303349256515503},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3280680179595947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30305904150009155},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07811427116394043},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-012-9668-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-012-9668-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0424769","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0230789","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1506627918","https://openalex.org/W1578813712","https://openalex.org/W1973020798","https://openalex.org/W1978593916","https://openalex.org/W1992734168","https://openalex.org/W1992876208","https://openalex.org/W2000850616","https://openalex.org/W2001855339","https://openalex.org/W2001927417","https://openalex.org/W2006905044","https://openalex.org/W2014071862","https://openalex.org/W2015231501","https://openalex.org/W2033433572","https://openalex.org/W2052586468","https://openalex.org/W2095794917","https://openalex.org/W2102201348","https://openalex.org/W2104144451","https://openalex.org/W2119344260","https://openalex.org/W2123976299","https://openalex.org/W2138118431","https://openalex.org/W2142033149","https://openalex.org/W2144110390","https://openalex.org/W2154014787","https://openalex.org/W2570889430","https://openalex.org/W2611804663","https://openalex.org/W4230573295","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320","https://openalex.org/W2142195909","https://openalex.org/W2032550399","https://openalex.org/W2057791178"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}
