{"id":"https://openalex.org/W2135783045","doi":"https://doi.org/10.1007/978-3-319-09174-7_24","title":"Decomposition Algorithm for the Single Machine Scheduling Polytope","display_name":"Decomposition Algorithm for the Single Machine Scheduling Polytope","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2135783045","doi":"https://doi.org/10.1007/978-3-319-09174-7_24","mag":"2135783045"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-09174-7_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09174-7_24","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":true,"oa_status":"green","oa_url":"https://research.utwente.nl/files/5339261/sched_decomp.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010930168","display_name":"Ruben Hoeksma","orcid":"https://orcid.org/0000-0002-6553-7242"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Ruben Hoeksma","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","Univ. of Twente#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Univ. of Twente#TAB#","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","Univ. of Twente#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Univ. of Twente#TAB#","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052226987","display_name":"Marc Uetz","orcid":"https://orcid.org/0000-0003-4223-2435"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marc Uetz","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","Univ. of Twente#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Univ. of Twente#TAB#","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010930168"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2649,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80467398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"291"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9948999881744385,"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/polytope","display_name":"Polytope","score":0.6940826177597046},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6530964374542236},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.6216104030609131},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6195603013038635},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5493037104606628},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5324419736862183},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5151768922805786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5013487339019775},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46079617738723755},{"id":"https://openalex.org/keywords/barycentric-coordinate-system","display_name":"Barycentric coordinate system","score":0.4539778232574463},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.4255492687225342},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.42171579599380493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37963372468948364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35233408212661743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33284619450569153},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.26013022661209106},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.19974833726882935},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0809812843799591}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6940826177597046},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6530964374542236},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.6216104030609131},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6195603013038635},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5493037104606628},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5324419736862183},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5151768922805786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5013487339019775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46079617738723755},{"id":"https://openalex.org/C128356825","wikidata":"https://www.wikidata.org/wiki/Q738422","display_name":"Barycentric coordinate system","level":2,"score":0.4539778232574463},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.4255492687225342},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.42171579599380493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37963372468948364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35233408212661743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33284619450569153},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.26013022661209106},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.19974833726882935},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0809812843799591}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-319-09174-7_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09174-7_24","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:ris.utwente.nl:publications/cd48a36f-5c51-49c8-b7d8-229d1e471249","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/cd48a36f-5c51-49c8-b7d8-229d1e471249","pdf_url":"https://research.utwente.nl/files/5339261/sched_decomp.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoeksma, R P, Manthey, B & Uetz, M J 2014, Decomposition algorithm for the single machine scheduling polytope. in Combinatorial Optimization, Third International Symposium, ISCO 2014. Lecture Notes in Computer Science, vol. 8596, Springer, pp. 280-291. https://doi.org/10.1007/978-3-319-09174-7_24","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/f59841aa-df3f-4086-8086-4afa0211ee40","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/f59841aa-df3f-4086-8086-4afa0211ee40","pdf_url":"https://ris.utwente.nl/ws/files/5116053/sched_decomp.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoeksma, R P, Manthey, B & Uetz, M J 2013, Decomposition algorithm for the single machine scheduling polytope. CTIT Technical Report Series, no. TR-CTIT-13-25, Centre for Telematics and Information Technology (CTIT), Enschede.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1001.3718","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1001.3718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://doc.utwente.nl/91477/1/sched_decomp.pdf","raw_type":"text"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/f59841aa-df3f-4086-8086-4afa0211ee40","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/decomposition-algorithm-for-the-single-machine-scheduling-polytope(f59841aa-df3f-4086-8086-4afa0211ee40).html","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:publications/cd48a36f-5c51-49c8-b7d8-229d1e471249","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/cd48a36f-5c51-49c8-b7d8-229d1e471249","pdf_url":"https://research.utwente.nl/files/5339261/sched_decomp.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoeksma, R P, Manthey, B & Uetz, M J 2014, Decomposition algorithm for the single machine scheduling polytope. in Combinatorial Optimization, Third International Symposium, ISCO 2014. Lecture Notes in Computer Science, vol. 8596, Springer, pp. 280-291. https://doi.org/10.1007/978-3-319-09174-7_24","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2135783045.pdf","grobid_xml":"https://content.openalex.org/works/W2135783045.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W27038116","https://openalex.org/W30074706","https://openalex.org/W142791843","https://openalex.org/W1486935562","https://openalex.org/W1526035966","https://openalex.org/W1539141971","https://openalex.org/W1597196612","https://openalex.org/W1815705819","https://openalex.org/W2012329067","https://openalex.org/W2015429465","https://openalex.org/W2035575256","https://openalex.org/W2038017315","https://openalex.org/W2075265959","https://openalex.org/W2080656989","https://openalex.org/W2100440346","https://openalex.org/W2128059732","https://openalex.org/W4206570602"],"related_works":["https://openalex.org/W2300145982","https://openalex.org/W2365830408","https://openalex.org/W2580512045","https://openalex.org/W981962503","https://openalex.org/W2098081711","https://openalex.org/W1569666406","https://openalex.org/W2363904277","https://openalex.org/W2375652826","https://openalex.org/W2082133472","https://openalex.org/W2583135805"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}