{"id":"https://openalex.org/W3211357163","doi":"https://doi.org/10.1007/978-3-031-18367-6_3","title":"Scheduling with\u00a0Machine Conflicts","display_name":"Scheduling with\u00a0Machine Conflicts","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W3211357163","doi":"https://doi.org/10.1007/978-3-031-18367-6_3","mag":"3211357163"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-18367-6_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-18367-6_3","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/A5013579048","display_name":"Moritz Buchem","orcid":"https://orcid.org/0000-0002-1590-346X"},"institutions":[{"id":"https://openalex.org/I209991678","display_name":"Maastricht School of Management","ror":"https://ror.org/04zb8fk81","country_code":"NL","type":"education","lineage":["https://openalex.org/I209991678"]},{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Moritz Buchem","raw_affiliation_strings":["School of Business and Economics, Maastricht University, Maastricht, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1590-346X","affiliations":[{"raw_affiliation_string":"School of Business and Economics, Maastricht University, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I209991678","https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090048794","display_name":"Linda Kleist","orcid":"https://orcid.org/0000-0002-3786-916X"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Linda Kleist","raw_affiliation_strings":["Department of Computer Science, TU Braunschweig, Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009705845","display_name":"Daniel Schmidt genannt Waldschmidt","orcid":"https://orcid.org/0000-0002-9331-445X"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Schmidt genannt Waldschmidt","raw_affiliation_strings":["Institute for Mathematics, TU Berlin, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9331-445X","affiliations":[{"raw_affiliation_string":"Institute for Mathematics, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009705845"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.236,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74701451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"36","last_page":"60"},"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.9922000169754028,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9836999773979187,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7646150588989258},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7508336901664734},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5829682350158691},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.550419270992279},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4946593940258026},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47484591603279114},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47025787830352783},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.44748175144195557},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41755884885787964},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3868982791900635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38211873173713684},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3634745478630066},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.34389495849609375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3260534405708313}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7646150588989258},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7508336901664734},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5829682350158691},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.550419270992279},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4946593940258026},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47484591603279114},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47025787830352783},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.44748175144195557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41755884885787964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3868982791900635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38211873173713684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3634745478630066},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.34389495849609375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3260534405708313},{"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/978-3-031-18367-6_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-18367-6_3","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:cris.maastrichtuniversity.nl:openaire_cris_publications/3e5e1ea1-a192-45c2-ad09-9e4920bc7d57","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/3e5e1ea1-a192-45c2-ad09-9e4920bc7d57","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buchem, M, Kleist, L & Schmidt genannt Waldschmidt, D 2022, Scheduling with Machine Conflicts. in P Chalermsook & B Laekhanukit (eds), Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Proceedings. vol. 13538 LNCS, Springer Verlag, Lecture Notes in Computer Science, vol. 13538 , pp. 36-60, 20th International Workshop on Approximation and Online Algorithms, Potsdam, Germany, 8/09/22. https://doi.org/10.1007/978-3-031-18367-6_3","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1492077731","https://openalex.org/W1540235234","https://openalex.org/W1563577400","https://openalex.org/W1905332030","https://openalex.org/W1965212320","https://openalex.org/W1977276352","https://openalex.org/W1990169944","https://openalex.org/W1998888933","https://openalex.org/W2002998496","https://openalex.org/W2004102446","https://openalex.org/W2011039300","https://openalex.org/W2012929820","https://openalex.org/W2013937449","https://openalex.org/W2019977411","https://openalex.org/W2037536345","https://openalex.org/W2043493954","https://openalex.org/W2049181186","https://openalex.org/W2051041531","https://openalex.org/W2052136967","https://openalex.org/W2064426857","https://openalex.org/W2067297441","https://openalex.org/W2073271726","https://openalex.org/W2074183570","https://openalex.org/W2081254453","https://openalex.org/W2085508662","https://openalex.org/W2088522084","https://openalex.org/W2089269509","https://openalex.org/W2089814876","https://openalex.org/W2093979815","https://openalex.org/W2098362962","https://openalex.org/W2104680817","https://openalex.org/W2126186592","https://openalex.org/W2133339885","https://openalex.org/W2140465653","https://openalex.org/W2484473493","https://openalex.org/W2759616628","https://openalex.org/W2911502905","https://openalex.org/W2912245972","https://openalex.org/W2963782499","https://openalex.org/W2965429996","https://openalex.org/W3036358944","https://openalex.org/W3088862872","https://openalex.org/W4293179730"],"related_works":["https://openalex.org/W1974309933","https://openalex.org/W2970302286","https://openalex.org/W4213379045","https://openalex.org/W2810352541","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W2142195909","https://openalex.org/W2151412766"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}