{"id":"https://openalex.org/W2921590375","doi":"https://doi.org/10.1051/ro/2020031","title":"Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes","display_name":"Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes","publication_year":2020,"publication_date":"2020-03-18","ids":{"openalex":"https://openalex.org/W2921590375","doi":"https://doi.org/10.1051/ro/2020031","mag":"2921590375"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2020031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190184.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190184.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042990200","display_name":"Lotte Berghman","orcid":"https://orcid.org/0000-0001-8977-3074"},"institutions":[{"id":"https://openalex.org/I129162050","display_name":"TBS Education","ror":"https://ror.org/0349y2q65","country_code":"FR","type":"education","lineage":["https://openalex.org/I129162050"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lotte Berghman","raw_affiliation_strings":["TBS Business School, 20 BD Lascrosses BP 7010, 31068 Toulouse Cedex 7, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TBS Business School, 20 BD Lascrosses BP 7010, 31068 Toulouse Cedex 7, France","institution_ids":["https://openalex.org/I129162050"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits C.R. Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050636913","display_name":"Vincent t'Kindt","orcid":"https://orcid.org/0000-0002-7440-2980"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210136805","display_name":"Laboratoire d'Informatique Fondamentale et Appliqu\u00e9e de Tours","ror":"https://ror.org/03r938j26","country_code":"FR","type":"facility","lineage":["https://openalex.org/I110017253","https://openalex.org/I4210136805"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vincent T\u2019kindt","raw_affiliation_strings":["Universit\u00e9 de Tours, Laboratoire d\u2019Informatique Fondamentale et Appliqu\u00e9e (EA 6300), ERL CNRS 7002 ROOT, 64 Avenue Jean Portalis, 37200 Tours, France","Universit\u00e9 de Tours, Laboratoire d'Informatique Fondamentale et Appliqu\u00e9e (EA 6300), ERL CNRS 7002 ROOT, 64 Avenue Jean Portalis, 37200 Tours, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Tours, Laboratoire d\u2019Informatique Fondamentale et Appliqu\u00e9e (EA 6300), ERL CNRS 7002 ROOT, 64 Avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I4210136805","https://openalex.org/I110017253","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Universit\u00e9 de Tours, Laboratoire d'Informatique Fondamentale et Appliqu\u00e9e (EA 6300), ERL CNRS 7002 ROOT, 64 Avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I4210136805","https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1808,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.55760835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"55","issue":null,"first_page":"S1747","last_page":"S1765"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9980000257492065,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/preprocessor","display_name":"Preprocessor","score":0.7976714968681335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.64319908618927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6335132122039795},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.6015412211418152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5516067743301392},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41477707028388977},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35546302795410156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3175519108772278},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21492111682891846},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.14977458119392395}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.7976714968681335},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.64319908618927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6335132122039795},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.6015412211418152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5516067743301392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41477707028388977},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35546302795410156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3175519108772278},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21492111682891846},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.14977458119392395}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1051/ro/2020031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190184.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/adfbb9d7-9b5c-41ff-8f80-b0cc73cd4a88","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/adfbb9d7-9b5c-41ff-8f80-b0cc73cd4a88","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berghman, L, Spieksma, F C R & T'kindt, V 2021, 'Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes', RAIRO - Operations Research, vol. 55, pp. S1747-S1765. https://doi.org/10.1051/ro/2020031","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-03001027v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03001027","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"RAIRO - Operations Research, 2020, ⟨10.1051/ro/2020031⟩","raw_type":"Journal articles"},{"id":"pmh:oai:numdam.org:RO_2021__55_S1_S1747_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2020031/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:pure.tue.nl:publications/adfbb9d7-9b5c-41ff-8f80-b0cc73cd4a88","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85102028061&partnerID=8YFLogxK","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Berghman, L, Spieksma, F C R & T'kindt, V 2021, 'Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes', RAIRO - Operations Research, vol. 55, pp. S1747-S1765. https://doi.org/10.1051/ro/2020031","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/adfbb9d7-9b5c-41ff-8f80-b0cc73cd4a88","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/adfbb9d7-9b5c-41ff-8f80-b0cc73cd4a88","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":"RAIRO - Operations Research, 55, S1747 - S1765. EDP Sciences","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1051/ro/2020031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/01/ro190184.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321454","display_name":"Belgian Federal Science Policy Office","ror":"https://ror.org/01fapfv42"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2921590375.pdf","grobid_xml":"https://content.openalex.org/works/W2921590375.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1517115096","https://openalex.org/W1971809832","https://openalex.org/W1971949801","https://openalex.org/W1982727680","https://openalex.org/W2000672358","https://openalex.org/W2000850616","https://openalex.org/W2004480472","https://openalex.org/W2039823842","https://openalex.org/W2047928292","https://openalex.org/W2060552317","https://openalex.org/W2067443608","https://openalex.org/W2102201348","https://openalex.org/W2122888771","https://openalex.org/W2124714712","https://openalex.org/W2140333448","https://openalex.org/W2159152246","https://openalex.org/W2162009963","https://openalex.org/W4252085291","https://openalex.org/W4300238461"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2379672298","https://openalex.org/W3169499720","https://openalex.org/W2029403470","https://openalex.org/W2397288865","https://openalex.org/W2352620736","https://openalex.org/W2048233275","https://openalex.org/W1973064890","https://openalex.org/W2390699817","https://openalex.org/W2023242492"],"abstract_inverted_index":{"We":[0,12,33,50],"consider":[1],"a":[2,40,55],"time-indexed":[3],"formulation":[4],"for":[5],"the":[6,20,61,64],"unrelated":[7],"parallel":[8],"machine":[9,22],"scheduling":[10],"problem.":[11],"show":[13],"that":[14],"all":[15],"polyhedral":[16],"knowledge":[17],"known":[18],"from":[19],"single":[21],"problem":[23],"(in":[24],"particular,":[25],"valid":[26,37],"inequalities)":[27],"is":[28],"applicable":[29],"to":[30],"this":[31],"formulation.":[32],"present":[34],"new":[35],"facet-inducing":[36],"inequalities":[38],"and":[39,59],"preprocessing":[41],"technique":[42],"involving":[43],"fixing":[44],"variables":[45],"based":[46],"on":[47,70],"reduced":[48],"costs.":[49],"combine":[51],"both":[52],"techniques":[53],"in":[54],"basic":[56],"cutting-plane":[57],"algorithm":[58,66],"test":[60],"performance":[62],"of":[63],"resulting":[65],"by":[67],"running":[68],"it":[69],"randomly":[71],"generated":[72],"instances.":[73]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}