{"id":"https://openalex.org/W2541841001","doi":"https://doi.org/10.1007/978-3-319-48749-6_44","title":"An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints","display_name":"An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2541841001","doi":"https://doi.org/10.1007/978-3-319-48749-6_44","mag":"2541841001"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-48749-6_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-48749-6_44","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":"book-chapter","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/A5005114302","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0003-3909-4916"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Lin Chen","raw_affiliation_strings":["MTA SZTAKI, Hungarian Academy of Science, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"MTA SZTAKI, Hungarian Academy of Science, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I4210117195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":["Department of Computer Science, Christian-Albrechts-University Kiel, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Christian-Albrechts-University Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038607563","display_name":"Wenchang Luo","orcid":"https://orcid.org/0000-0002-0335-3253"},"institutions":[{"id":"https://openalex.org/I109935558","display_name":"Ningbo University","ror":"https://ror.org/03et85d35","country_code":"CN","type":"education","lineage":["https://openalex.org/I109935558"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenchang Luo","raw_affiliation_strings":["Faculty of Science, Ningbo University, Ningbo, 315211, China"],"affiliations":[{"raw_affiliation_string":"Faculty of Science, Ningbo University, Ningbo, 315211, China","institution_ids":["https://openalex.org/I109935558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027216962","display_name":"Guochuan Zhang","orcid":"https://orcid.org/0000-0003-1947-7872"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guochuan Zhang","raw_affiliation_strings":["College of Computer Science, Zhejiang University, Hangzhou, 310027, China"],"affiliations":[{"raw_affiliation_string":"College of Computer Science, Zhejiang University, Hangzhou, 310027, China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5005114302"],"corresponding_institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3641,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.93006993,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"608","last_page":"623"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9983999729156494,"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.9955999851226807,"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/rounding","display_name":"Rounding","score":0.7033015489578247},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6634519696235657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.618181586265564},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5770317912101746},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5578648447990417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5502262115478516},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5238723158836365},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.516040563583374},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5046063661575317},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.48872876167297363},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.47664862871170044},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4713016748428345},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4544232189655304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3263400197029114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3090556859970093},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2906455397605896}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7033015489578247},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6634519696235657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.618181586265564},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5770317912101746},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5578648447990417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5502262115478516},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5238723158836365},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.516040563583374},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5046063661575317},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.48872876167297363},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.47664862871170044},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4713016748428345},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4544232189655304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3263400197029114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3090556859970093},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2906455397605896},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":1,"locations":[{"id":"doi:10.1007/978-3-319-48749-6_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-48749-6_44","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"},{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1447903712","https://openalex.org/W1540235234","https://openalex.org/W1601005720","https://openalex.org/W1977276352","https://openalex.org/W2014770281","https://openalex.org/W2026129593","https://openalex.org/W2026405784","https://openalex.org/W2027038333","https://openalex.org/W2034931448","https://openalex.org/W2056047740","https://openalex.org/W2065011764","https://openalex.org/W2073271726","https://openalex.org/W2089099831","https://openalex.org/W2093979815","https://openalex.org/W2103882950","https://openalex.org/W2172955861","https://openalex.org/W2400967302","https://openalex.org/W2418875759","https://openalex.org/W2952993429","https://openalex.org/W2963782499"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W2268207117","https://openalex.org/W4300488607","https://openalex.org/W1504892637","https://openalex.org/W2543175834","https://openalex.org/W1977980414","https://openalex.org/W2054428995","https://openalex.org/W1982492546","https://openalex.org/W169553655","https://openalex.org/W1596683029"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}